Difference between revisions of "Euler's Totient Theorem"

m (Statement)
(No difference)

Revision as of 10:45, 30 July 2006


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.

See also

Invalid username
Login to AoPS