4.II.5E

Numbers and Sets | Part IA, 2001

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

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

[Hint: k(pk)(modp)k \equiv-(p-k)(\bmod p).]

Typos? Please submit corrections to this page on GitHub.