If p is prime, prove that for any integer a, p divides a^p + (p-1)!a and p divides (p-1)!a^p + a

Printable View

- Nov 23rd 2009, 08:29 AMMichaelGPrime number Proof
If p is prime, prove that for any integer a, p divides a^p + (p-1)!a and p divides (p-1)!a^p + a

- Nov 23rd 2009, 08:34 AMqmechwilson's theorem
For a prime p Wilson's theorem says that (p-1)! = -1 mod p.

Also, Fermat's little theorem says that for a s.t. (a,p) = 1 (no common factor), a^(p-1) = 1 (p), which implies that a^p = a (p).

Try these in your problem. - Nov 23rd 2009, 07:47 PMchiph588@
Note that $\displaystyle a^p \equiv a \mod{p} \; \forall a $ though.