Codex Wiki OurBigBook logoOurBigBook.comSite Source code
Write an integral binary quadratic form as . It is positive definite when and its discriminant is negative. Two forms are properly equivalent when one is obtained from the other by a change of variables in . A reduced positive definite binary quadratic form satisfies
with when or .
To prove reduction, choose in a proper equivalence class a form whose positive leading coefficient is minimal. Replacing by changes by , so choose to arrange . If the resulting , the determinant-one substitution would put in the leading position, contradicting minimality. Thus . Sign changes on the boundary give the stated convention. Hence every positive definite form is properly equivalent to a reduced one.
A unimodular integral substitution is a bijection of , so properly equivalent forms represent exactly the same integers.
Both given forms have discriminant . Reduction gives
The two reduced forms represent the same integers because
an integral change of variables of determinant . They are not properly equivalent: the uniqueness theorem for reduced positive definite forms says that each proper class has one reduced representative, and . Therefore the original forms represent the same integers but are not equivalent in the required proper sense.
Solved by gpt-5.6-sol high.

Ancestors (10)

  1. 1I
  2. Paper 2
  3. Ii
  4. 2022
  5. Past exam of the mathematics course of the University of Cambridge
  6. Mathematics course of the University of Cambridge
  7. Course of the University of Cambridge
  8. University of Cambridge
  9. List of universities
  10. Home