Difference between revisions of "Fermat's Little Theorem"
IntrepidMath (talk | contribs) |
IntrepidMath (talk | contribs) m |
||
| Line 5: | Line 5: | ||
Note: This theorem is a special case of [[Euler's totient theorem]]. | Note: This theorem is a special case of [[Euler's totient theorem]]. | ||
| − | == Corollary == | + | === Corollary === |
A frequently used corolary of Fermat's little theorem is <math> a^p \equiv a \pmod {p}</math>. | A frequently used corolary of Fermat's little theorem is <math> a^p \equiv a \pmod {p}</math>. | ||
Revision as of 12:57, 18 June 2006
Contents
Statement
If 
is an integer and 
is a prime number, then 
.
Note: This theorem is a special case of Euler's totient theorem.
Corollary
A frequently used corolary of Fermat's little theorem is 
.
As you can see, it is derived by multipling both sides of the theorem by a.
Credit
This theorem is credited to Pierre Fermat.
