Fermat's Little Theorem

Revision as of 09:55, 18 June 2006 by Chess64 (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Statement

If ${a}$ is an integer and $p$ is a prime number, then $a^{p-1}\equiv 1 \pmod {p}$.

Note: This theorem is a special case of Euler's totient theorem.

Credit

This theorem is credited to Pierre Fermat.

Invalid username
Login to AoPS