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 .
For odd prime to 35, proper representation by a positive definite binary quadratic form of discriminant is equivalent to being a square modulo every prime divisor of . A primitive representing vector extends to a determinant-one integer matrix, producing a form with leading coefficient and middle coefficient satisfying . Conversely this congruence constructs such a form. Its local roots lift to prime powers and combine by the Chinese remainder theorem. Every class reduces to one of and . The condition is local at each prime divisor; a product Jacobi symbol equal to one alone is insufficient.
Articles by others on the same topic
There are currently no matching articles.