Difference between revisions of "Euler's Totient Theorem"

m (fixed LaTeX)
(Added reference to Fermat's Little Thm)
Line 5: Line 5:
 
=== Credit ===
 
=== Credit ===
  
This theorem is credited to [[Leonhard Euler]].
+
This theorem is credited to [[Leonhard Euler]].  It is a generalization of [[Fermat's Little Theorem]], which specifies that <math>{m}</math> is prime.
  
 
=== See also ===
 
=== See also ===
Line 12: Line 12:
 
* [[Modular arithmetic]]
 
* [[Modular arithmetic]]
 
* [[Euler's totient function]]
 
* [[Euler's totient function]]
* [[Fermat's Little Theorem]]
 

Revision as of 19:09, 18 June 2006

Statement

Let $\phi(n)$ be Euler's totient function. If ${a}$ is an integer and $n$ is a positive integer, 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

Invalid username
Login to AoPS