Trap Door

Pierre Fermat, 1640.

Fermat's Little Theorem:  if x is an integer which is not divisible by a prime p, then

[Graphics:Images/index_gr_1.gif]

Proof (not Fermat's)

The number [Graphics:Images/index_gr_2.gif] of positive integers less than or equal to p which don't have any common factors with p is p-1, since p is a prime.  Then Fermat's Little Theorem follows from Euler's Theorem.

Next Section


Converted by Mathematica      March 17, 2001