Using Wilson’s theorem, prove that for any odd prime p,
[Hint: Because k ≡ − (p − k) (mod p), it follows that
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.