3.II.11H

Number Theory | Part II, 2008

State the reciprocity law for the Jacobi symbol.

Let aa be an odd integer >1>1, which is not a square. Prove that there exists a positive integer nn such that n1mod4n \equiv 1 \bmod 4 and

(na)=1\left(\frac{n}{a}\right)=-1

Prove further that there exist infinitely many prime numbers pp such that

(ap)=1\left(\frac{a}{p}\right)=-1

Typos? Please submit corrections to this page on GitHub.