Fermat's Little Theorem

Revision as of 12:57, 18 June 2006 by IntrepidMath (talk | contribs)


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.


A frequently used corolary of Fermat's little theorem is $a^p \equiv a \pmod {p}$. As you can see, it is derived by multipling both sides of the theorem by a.


This theorem is credited to Pierre Fermat.

See also

Invalid username
Login to AoPS