Class number problem
Class number problem
For a squarefree integer put , let be the ring of integers of , and let
be the order of the ideal class group of , i.e. the class number of . The discriminant of is if and otherwise; the integers arising in this way are called fundamental discriminants, and for such write . More generally, for an arbitrary integer with , let denote the number of -equivalence classes of primitive positive definite integral binary quadratic forms with .
The following hold.
- For every integer the set
is finite, and it is effectively determinable: there is an algorithm which, given , outputs a finite list of discriminants together with a proof that this list is exactly . Equivalently, as through negative fundamental discriminants, with an effective bound such that forces .
-
For every integer the set of all integers with (not necessarily fundamental) and is finite and likewise effectively determinable; in particular the set of even such with can be listed completely.
-
The set
is infinite; that is, there are infinitely many real quadratic fields , squarefree, with class number .
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Additional references
- Wikipedia, Class number problem, the article this problem comes from.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.