Fermat's Little Theorem: if x is an integer which is not divisible by a prime p, then
![[Graphics:Images/index_gr_1.gif]](Images/index_gr_1.gif)
The number 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.