Enumeration of reduced binary quadratic forms
ID: enumeration-of-reduced-binary-quadratic-forms
Let with or . A reduced positive definite binary quadratic form of discriminant of a binary quadratic form satisfiesConsequently every reduced form can be found by a finite search:
- choose ;
- choose with ;
- put and retain ;
- on or , retain only .
To count the class number of a negative discriminant, additionally retain only primitive binary quadratic forms, those with . Otherwise the search also lists imprimitive forms. For example, gives and , but only the first is primitive, so . This distinction is essential when turning an enumeration into a class-number claim.
New to topics? Read the docs here!