# Difference between revisions of "Euler's Totient Theorem"

m (Euler's Totient Theorem moved to Euler's totient theorem) |
m (Added a little info.) |
||

Line 5: | Line 5: | ||

=== Credit === | === Credit === | ||

− | This theorem is credited to [[Leonhard Euler]]. It is a generalization of [[Fermat's Little Theorem]], which specifies that <math>{m}</math> is prime. | + | This theorem is credited to [[Leonhard Euler]]. It is a generalization of [[Fermat's Little Theorem]], which specifies that <math>{m}</math> is prime. For this reason it is known as Euler's generalization and Fermat-Euler as well. |

=== See also === | === See also === |

## Revision as of 13:41, 4 November 2006

### 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.