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

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