Difference between revisions of "Fermat's Little Theorem"

m (Statement)
m (Statement)
Line 1: Line 1:
 
=== Statement ===
 
=== Statement ===
  
If <math>{a}</math> is an [[integer]] and <math>{p}</math> is a [[prime number]], then <math>a^{p-1}\equiv 1 \pmod {p}</math>.
+
If <math>{a}</math> is an [[integer]] and <math>{p}</math> is a [[prime]] number, then <math>a^{p-1}\equiv 1 \pmod {p}</math>.
  
 
Note: This theorem is a special case of [[Euler's totient theorem]].
 
Note: This theorem is a special case of [[Euler's totient theorem]].

Revision as of 09:55, 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.

Invalid username
Login to AoPS