Metraipolis › archive › dc_070985da3ae8

Class number problem — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Class_number_problem
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-15T19:34:31.272Z
SHA-256 of the archived text
e793fb29c27ca1cc25961b4b0089966dd566b76d84a838240f01fc6b213c1b0b
Stable URL of this page
https://metraipolis.com/documento/dc_070985da3ae8

How to cite

Class number problem — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Class_number_problem (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_070985da3ae8 (Metraipolis archive dc_070985da3ae8, sha256 e793fb29c27ca1cc25961b4b0089966dd566b76d84a838240f01fc6b213c1b0b)
BibTeX
@misc{dc070985da3ae8,
  title = {Class number problem — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Class_number_problem},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_070985da3ae8; sha256 e793fb29c27ca1cc25961b4b0089966dd566b76d84a838240f01fc6b213c1b0b},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Class_number_problem. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In mathematics, the Gauss class number problem (for imaginary quadratic fields), as usually understood, is to provide for each n ≥ 1 {\displaystyle n\geq 1} a complete list of imaginary quadratic fields Q ( d ) {\displaystyle \mathbb {Q} ({\sqrt {d}})} (for negative integers d {\displaystyle d} ) having class number n {\displaystyle n} . It is named after Carl Friedrich Gauss. It can also be stated in terms of discriminants. There are related questions for real quadratic fields and for the behavior as d → − ∞ {\displaystyle d\to -\infty } . The difficulty is in effective computation of bounds: for a given discriminant, it is easy to compute the class number, and there are several ineffective lower bounds on class number (meaning that they involve a constant that is not computed), but effective bounds (and explicit proofs of completeness of lists) are harder.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «number theory»).
Fonte: Wikipedia in inglese, voce «Class number problem» — https://en.wikipedia.org/wiki/Class_number_problem
Wikidata Q2403973 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2403973
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Class_number_problem?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1365087599, consultata il 2026-10-15T18:44:39.839Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: dc7514ed01a81ef4af24a4f6b9aa26a7219408d1bb925b9c7fc9efd74c97c3ff