Paper 4, Section II, D

Numbers and Sets | Part IA, 2017

(a) State and prove the Fermat-Euler Theorem. Deduce Fermat's Little Theorem. State Wilson's Theorem.

(b) Let pp be an odd prime. Prove that X2≡−1( mod p)X^{2} \equiv-1(\bmod p) is solvable if and only if p≡1( mod 4)p \equiv 1(\bmod 4).

(c) Let pp be prime. If hh and kk are non-negative integers with h+k=p−1h+k=p-1, prove that h!k!+(−1)h≡0( mod p).h ! k !+(-1)^{h} \equiv 0(\bmod p) .

Typos? Please submit corrections to this page on GitHub.