Prove Fermat's theorem: If p is a prime integer and a is an integer such that p does...

Prove Fermat's theorem: If p is a prime integer and a is an integer such that p does not divide a, then (mod p). (Hint: Show that

and use Exercise 29 to cancel 2, 3, ………….., p – 1 from both sides.)