Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Euler's Totient Theorem

Revision as of 11:30, 18 June 2006 by Chess64 (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Statement

Let $\phi(n)$ be Euler's totient function. If ${a}$ is an integer and $n$ is a positive integer, then $a^{\phi(m)}\equiv 1 \pmod {m}$.

Credit

This theorem is credited to Leonhard Euler.

See also

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Euler%27s_Totient_Theorem&oldid=2610"