Paper 1, Section I, H

Number Theory | Part II, 2015

Define the Legendre symbol (ap)\left(\frac{a}{p}\right). State and prove Euler's criterion, assuming if you wish the existence of primitive roots modp\bmod p.

By considering the prime factors of n2+4n^{2}+4 for nn an odd integer, prove that there are infinitely many primes pp with p5(mod8)p \equiv 5(\bmod 8).

Typos? Please submit corrections to this page on GitHub.