For negative discriminant , a reduced positive definite binary quadratic form satisfies and odd with . Checking leaves only under the boundary convention. The reduction algorithm for a positive definite binary quadratic form therefore puts every form in this one proper equivalence of binary quadratic forms class. Its unimodular shears give infinitely many distinct forms .
Articles by others on the same topic
There are currently no matching articles.