Paper 1, Section I, 1I

Number Theory | Part II, 2021

State Euler's criterion.

Let pp be an odd prime. Show that every primitive root modulo pp is a quadratic non-residue modulo pp.

Let pp be a Fermat prime, that is, a prime of the form 22k+12^{2^{k}}+1 for some k1k \geqslant 1. By evaluating ϕ(p1)\phi(p-1), or otherwise, show that every quadratic non-residue modulo pp is a primitive root modulo pp. Deduce that 3 is a primitive root modulo pp for every Fermat prime pp.

Typos? Please submit corrections to this page on GitHub.