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

Invalid username
Login to AoPS