Paper 3, Section II, I

Number Theory | Part II, 2013

Define equivalence of binary quadratic forms and show that equivalent forms have the same discriminant.

Show that an integer nn is properly represented by a binary quadratic form of discriminant dd if and only if x2dmod4nx^{2} \equiv d \bmod 4 n is soluble in integers. Which primes are represented by a form of discriminant 20-20 ?

What does it mean for a positive definite form to be reduced? Find all reduced forms of discriminant 20-20. For each member of your list find the primes less than 100 represented by the form.

Typos? Please submit corrections to this page on GitHub.