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]] | ||
| − | |||
Revision as of 18:09, 18 June 2006
Statement
Let 
be Euler's totient function. If 
is an integer and 
is a positive integer, then 
.
Credit
This theorem is credited to Leonhard Euler. It is a generalization of Fermat's Little Theorem, which specifies that 
is prime.
