Art of Problem Solving

Fermat's Little Theorem: Difference between revisions

Chess64 (talk | contribs)
Chess64 (talk | contribs)
No edit summary
Line 8: Line 8:


This theorem is credited to [[Pierre Fermat]].
This theorem is credited to [[Pierre Fermat]].
=== See also ===
* [[Number theory]]
* [[Modular arithmetic]]
* [[Euler's phi function]]
* [[Euler's totient theorem]]

Revision as of 09:56, 18 June 2006

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.

See also