Difference between revisions of "Euler's Totient Theorem"
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]).) |
m (→See also) |
||
| Line 12: | Line 12: | ||
* [[Modular arithmetic]] | * [[Modular arithmetic]] | ||
* [[Euler's totient function]] | * [[Euler's totient function]] | ||
| + | * [[Carmichael function]] | ||
Revision as of 18:43, 26 January 2007
Statement
Let 
be Euler's totient function. If 
is an integer and 
is a positive integer relatively prime to 
, then 
.
Credit
This theorem is credited to Leonhard Euler. It is a generalization of Fermat's Little Theorem, which specifies that 
is prime. For this reason it is known as Euler's generalization and Fermat-Euler as well.
