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

Bpms (talk | contribs)
m Added a little info.
m Euler's totient theorem moved to Euler's Totient Theorem: Capitalization policy is currently to capitalize names of theorems, I believe (see [http://www.artofproblemsolving.com/Forum/viewtopic.php?t=97741 here]).
(No difference)

Revision as of 19:42, 4 November 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. For this reason it is known as Euler's generalization and Fermat-Euler as well.

See also