Art of Problem Solving
During AMC 10A/12A testing, the AoPS Wiki is in read-only mode and no edits can be made.

Euler's Totient Theorem: Difference between revisions

ComplexZeta (talk | contribs)
Joml88 (talk | contribs)
(No difference)

Revision as of 09:45, 30 July 2006

Statement

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}$.

Credit

This theorem is credited to Leonhard Euler. It is a generalization of Fermat's Little Theorem, which specifies that ${m}$ is prime.

See also