Number theory Algebraic number theory Problem
Class number problem
Problem
For each positive integer , determine the complete list of imaginary quadratic fields , with a positive squarefree integer, whose class number equals .
Remarks
The problem goes back to Gauss, who stated it in the language of binary quadratic forms. It has three parts: show that the class number tends to infinity as , so that each list is finite; make this effective; and compute the lists.
Status: the class number of tends to infinity with (Heilbronn), but this proof gives no effective bound. The case is the Stark–Heegner theorem, with nine fields, and the case was solved by Baker and by Stark. Goldfeld, combined with the theorem of Gross and Zagier, gave an effective lower bound for the class number, which reduces each to a finite computation. Watkins completed the lists for all .
The analogue for real quadratic fields is open: it is not known whether infinitely many real quadratic fields have class number .
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Binary quadratic form concept
- Class number concept
- Quadratic field concept
- Class number problem problem
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | KTGAS9DGRX |
|---|---|
| URI | m2://KTGAS9DGRX |
| Kind | problem |
| Writing | W0 stub |
| MSC | 11R29, 11R11 |
| Status | This copy of the site has no build data. Run m2 status KTGAS9DGRX. |
| About | Class number, Quadratic field |
| Uses | Quadratic field, Class number, Binary quadratic form |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.