Difference between revisions of "Euler's Totient Theorem"

m (See also)
Line 13: Line 13:
 
* [[Euler's totient function]]
 
* [[Euler's totient function]]
 
* [[Carmichael function]]
 
* [[Carmichael function]]
 +
 +
[[Category:Number Theory]]
 +
 +
[[Category:Theorems]]

Revision as of 20:38, 14 October 2007

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