(a) Prove that an integer n > 1 is prime if and only if (n − 2)! ≡ 1 (mod n).
(b) If nis a composite integer, show that (n− 1)! ≡0 (mod n),except when n= 4.
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.