Difference between revisions of "Euler's Totient Theorem"

(correct category)
Line 15: Line 15:
* [[Carmichael function]]
* [[Carmichael function]]
[[Category:Number Theory]]
[[Category:Number theory]]

Revision as of 19:31, 4 September 2008

Euler's Totient Theorem is a theorem closely related to his function of the same name.


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