Class number of a negative discriminant Created 2026-09-24 Updated 2026-11-05
For a negative discriminant of a binary quadratic form or , the class number of a negative discriminant counts proper equivalence classes of primitive binary quadratic forms that are positive definite and have discriminant .
Uniqueness of the reduced positive definite binary quadratic form in each class makes this the number of reduced primitive forms. Enumeration of reduced binary quadratic forms proves finiteness and gives an explicit procedure. For example, , represented by , while , with the four forms listed under reduced positive definite binary quadratic forms of discriminant minus thirty-nine.
Imprimitive forms do not enter . At , the reduced form has content two, so the three reduced forms listed under reduced forms of discriminant minus thirty-two contribute only two primitive classes. If is a fundamental discriminant, this form class number agrees with the class number of the imaginary quadratic field of discriminant . For nonfundamental , the associated order in a number field need not be the full ring of integers, so that distinction must be retained.
Class number problem Created 2026-10-03 Updated 2026-11-05
A class number problem asks which number field or order in a number field has a prescribed class number. The family is part of the question: fixing the value alone does not specify the degree, discriminant or type of field.
For imaginary quadratic fields, it becomes a problem about negative fundamental discriminants and the class number of a negative discriminant . Allowing nonfundamental discriminants instead includes an order in a number field smaller than the full ring of integers. A reduced positive definite binary quadratic form and the enumeration of reduced binary quadratic forms make each fixed negative-discriminant case an explicit finite calculation.
For example, class number one for discriminant minus sixty-seven proves by exhausting the reduced coefficient possibilities. In a number field, class number one means every ideal of the ring of integers is principal, so the ring is a principal ideal domain. This connects a numerical classification with the arithmetic question of whether ideal obstructions to unique factorization remain. A computation for one discriminant does not by itself classify all discriminants of that class number.
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 2 1H Solution Created 2026-09-24 Updated 2026-10-14
For an integral binary quadratic form with and , the reduced positive definite binary quadratic form convention is , with on either boundary or . Since , the enumeration of reduced binary quadratic forms for has . The integer is odd. For , only is retained and ; for , both give . Thus the complete list isA proper representation of a prime uses a primitive representing vector. Completing that vector to a matrix in transforms a representing form to , so its discriminant of a binary quadratic form gives . Conversely, choose an odd satisfying this congruence and put . This is integral, and is positive definite and represents at . This proves the discriminant criterion for prime representation by a binary quadratic form here.
For , quadratic reciprocity gives . Including the ramified prime, the answer is thereforeFor example supplies a proper representation of . Reduction transfers every such representation to one of the three displayed forms.
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 1I Solution Created 2026-09-24 Updated 2026-10-14
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 givesSince , 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
Past exam of the mathematics course of the University of Cambridge 2018 ii Paper 3 11G Solution Created 2026-09-24 Updated 2026-10-03
Write an integral binary quadratic form as , with discriminant of a binary quadratic form . It is positive definite when and . Two forms are equivalent if one is obtained from the other by an integral linear change of variables whose matrix lies in . A positive definite form is reduced whenwith when or .
To reduce a form, apply a unimodular shear with chosen so that the new middle coefficient has . If the new final coefficient is smaller than , exchange the variables, using a determinant-one rotation, so that the positive leading coefficient decreases from to . Repeating must stop because a positive integer cannot decrease indefinitely. At termination , and elementary sign changes impose the boundary convention. This is the reduction algorithm for a positive definite binary quadratic form, and proves that every positive definite form is equivalent to a reduced one.
The displayed forms have discriminant , so the intended discriminant is . For any reduced form of this discriminant, enumeration of reduced binary quadratic forms givesThe boundary convention and direct checking of leave only
Suppose first that a prime is represented by . The identityshows modulo both and that is a nonzero square. HenceSimilarly,Modulo , this says is a square, while modulo it says is a square. Since , the multiplicativity of the Legendre symbol gives
Conversely, suppose the two displayed Legendre symbols have the same sign. By quadratic reciprocity,Choose an odd integer satisfying . Since is odd, is also divisible by , sois a positive definite integral form of discriminant that represents . Reducing yields either or , and equivalence preserves represented integers. The necessary symbol calculation above determines which one: the positive pair selects , and the negative pair selects . Therefore
Past exam of the mathematics course of the University of Cambridge 2023 ii Paper 3 11G Solution Created 2026-09-23 Updated 2026-09-25
Write an integral binary quadratic form asA positive definite form is a reduced positive definite binary quadratic form whenwith on the boundary or . The class number of a negative discriminant is the number of proper equivalence classes of primitive positive definite integral forms of discriminant .
Every such class has a reduced representative. For a reduced form,soThere are only finitely many possible integers and , and thenis determined. Hence . There is at least one class: the principal form isandThus , in agreement with the enumeration of reduced binary quadratic forms.
Now let be prime. The two formsare primitive, positive definite, reduced, and have discriminant . They are not properly equivalent: represents one, while the least positive value of is two. Therefore
Assume henceforth that , so these are the only two classes. Iffor a prime , then is odd andMoreover , so is a quadratic residue modulo . This proves the necessity.
Conversely, suppose and is a quadratic residue modulo . By quadratic reciprocity, these two conditions implyIndeed, for both relevant signs are positive, while for the signs from and reciprocity with cancel. Choose an even integer such thatThenis a primitive positive definite integral form of discriminant and represents . It belongs to one of the two classes .
The second form cannot represent such a prime. Ifthen is odd and, since ,This contradicts . Hence lies in the principal class , and proper equivalence of binary quadratic forms preserves represented integers. ThereforeThis is the prime representation when h of minus eight q equals two.
Primes represented by x squared plus three y squared Created 2026-10-13 Updated 2026-11-05
A prime number has an integer representation exactly when or . The case three is , and two is impossible.
For necessity when , reducing the equation modulo three gives . The value cannot be zero, so it is one.
Conversely, for , the quadratic character of minus three shows that is a quadratic residue modulo . Thus the discriminant criterion for prime representation by a binary quadratic form produces a positive definite form of discriminant representing . It is primitive because .
Enumeration of reduced binary quadratic forms gives only and at discriminant : the bound is , and the integrality and boundary conditions leave those two. The second is imprimitive, so proper equivalence carries the representing form to . This proves sufficiency. Examples are and .
Reduced positive definite binary quadratic forms of discriminant minus thirty-five Created 2026-10-03 Updated 2026-11-05
At discriminant of a binary quadratic form , the reduced positive definite binary quadratic forms are exactlyThe enumeration of reduced binary quadratic forms bound gives . For , the required odd and the divisibility leave precisely those two triples after the boundary sign convention. Both are primitive, so .
For a prime number , represents exactly when both Legendre symbols and are one; represents exactly when both are minus one. The square-completion identitiesprove the necessary signs modulo five and seven: four is a square at both primes, whereas twelve is a quadratic nonresidue at both.
For sufficiency, either matching sign pair gives by quadratic reciprocity. The discriminant criterion for prime representation by a binary quadratic form then supplies a primitive form of discriminant representing . It reduces to one of the two listed forms, and their distinct sign conditions determine which. For example, , whereas .