At discriminant of a binary quadratic form , the reduced positive definite binary quadratic forms are exactly
The 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 identities
prove 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 .
The reduced positive definite binary quadratic form bounds and imply . Enumerating and using the nonnegative boundary sign convention gives the four triples . Thus the number of reduced forms is four.
Reduction algorithm for a positive definite binary quadratic form Created 2026-10-03 Updated 2026-11-05
For a positive definite integral binary quadratic form with discriminant of a binary quadratic form , choose an integer so that lies in . The determinant-one shear gives
The last polynomial coefficient is also . If , use the determinant-one rotation to replace the form by , and repeat.
Each rotation strictly decreases the positive integer leading polynomial coefficient. Thus only finitely many rotations occur. At termination, . The chosen interval already gives when ; if and , one final rotation changes its sign. Every step preserves proper equivalence and the discriminant of a binary quadratic form, so this constructs a reduced positive definite binary quadratic form.
For example, start with , of discriminant of a binary quadratic form . Taking gives . Rotate to , then take again to obtain . The coefficients can shrink dramatically while the represented integers remain unchanged. Using a plain swap of variables would instead have determinant minus one; the sign in the rotation keeps every step proper.
Two distinguished classes of discriminant minus eight q Created 2026-09-24 Updated 2026-11-05
For an odd prime , the forms
are primitive binary quadratic forms of discriminant of a binary quadratic form . Their diagonal polynomial coefficients are positive, so they are positive definite, and makes both satisfy the reduced positive definite binary quadratic form inequalities.
Their proper equivalence classes are distinct. The first represents one at , but the second has minimum positive value two: if , , while and give at least two. Since proper equivalence preserves represented integers, the two forms cannot be equivalent.
Thus . If the class number of a negative discriminant is exactly two, these are all its primitive proper classes. That completeness hypothesis is the reason a local square test can select one specific form in prime representation when h of minus eight q equals two.