Euler's Totient Theorem

Revision as of 19:43, 26 January 2007 by Chess64 (talk | contribs) (See also)


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


This theorem is credited to Leonhard Euler. It is a generalization of Fermat's Little Theorem, which specifies that ${m}$ is prime. For this reason it is known as Euler's generalization and Fermat-Euler as well.

See also

Invalid username
Login to AoPS