A Proof of Fermat's Little Theorem

robert Ihnot

r divides s, p divides r and p does not divide s,

This is what looks wrong to Dodo, just ignore it.

Now use the binomial theorem to prove by induction on n that p divides n^p - n.

What is said about is the Key Statement and a giveaway. For p a prime, just start with the usual begining n=1.

robert Ihnot Recognitions: Gold Member	r divides s, p divides r and p does not divide s, This is what looks wrong to Dodo, just ignore it. Now use the binomial theorem to prove by induction on n that p divides n^p - n. What is said about is the Key Statement and a giveaway. For p a prime, just start with the usual begining n=1.