4.II.5E

Numbers and Sets | Part IA, 2001

(a) Prove Wilson's theorem, that (p−1)!≡−1( mod p)(p-1) ! \equiv-1(\bmod p), where pp is prime.

(b) Suppose that pp is an odd prime. Express 12.32.52…(p−2)2( mod p)1^{2} .3^{2} .5^{2} \ldots(p-2)^{2}(\bmod p) as a power of −1-1.

[Hint: k≡−(p−k)( mod p)k \equiv-(p-k)(\bmod p).]

Typos? Please submit corrections to this page on GitHub.