Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2011/ii/paper-1/1i/solution

Use the reduction algorithm for a positive definite binary quadratic form. A determinant-one shear puts the middle coefficient in . If the resulting last coefficient is smaller than , the determinant-one substitution decreases the positive integer leading coefficient. Repeating terminates with a reduced positive definite binary quadratic form satisfying . These substitutions preserve proper equivalence of binary quadratic forms and the discriminant of a binary quadratic form.
The enumeration of reduced binary quadratic forms gives
Since , is odd. For , the possible values of are respectively . Each is a prime number greater than seven. But , so its positive divisor must be one. Then forces and . The two signs are properly equivalent: substituting in gives . Thus every form in question is properly equivalent to

New to topics? Read the docs here!