If p is a prime, prove that for any integer a,
[Hint: By Wilson’s theorem, ap +(p≡ 1 )!a ≡ ap − a (mod p).]
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.