Paper 1, Section I, 1I
State Euler's criterion.
Let be an odd prime. Show that every primitive root modulo is a quadratic non-residue modulo .
Let be a Fermat prime, that is, a prime of the form for some . By evaluating , or otherwise, show that every quadratic non-residue modulo is a primitive root modulo . Deduce that 3 is a primitive root modulo for every Fermat prime .
Typos? Please submit corrections to this page on GitHub.