4Room 4 of 91900
Hilbert's list
Mathematische Probleme
Mathematische Probleme.
D. HILBERT
8. Primzahlprobleme.
Nachrichten, Göttingen
Hilbert set 23 problems for a new century
On 8 August 1900, at the Sorbonne in Paris, David Hilbert stood up at the International Congress of Mathematicians and read out ten problems. The full list of 23 came out in print afterwards, and in English in 1902.
Problem 8 is about primes. It bundles the Riemann hypothesis with Goldbach's conjecture and the twin primes. Hilbert also asked whether the gap between the prime count and Gauss's curve grows no faster than the square root of x. That's the band you dragged in room 1.
A hundred years later the Clay Mathematics Institute picked seven Millennium Prize Problems, a million dollars each. The Riemann hypothesis made both lists.
There's more in the Run Data Run Deep Dive.
- Maker
- David Hilbert
- Read
- 8 August 1900, the Sorbonne, Paris
- Printed
- Nachrichten, Göttingen
- English
- Bulletin of the AMS, 1902, translated by Mary Frances Winston Newson
- Problem
- 8, Primzahlprobleme
Problem 8, in the 1902 translation“it still remains to prove the correctness of an exceedingly important statement of Riemann, viz., that the zero points of the function ζ(s)… all have the real part 1/2, except the well-known negative integral real zeros.”
The register of 23 problems
Sort
Show
View
9 Resolved6 Disputed6 Open2 Too vague to settle
23 problems shown, sorted by number.
- Gödel and Cohen showed it can be neither proved nor disproved from the standard axioms. No consensus that this answers Hilbert.
- Gödel's second incompleteness theorem says it can't be done inside arithmetic. Gentzen gave a proof from outside it in 1936.
- No. Max Dehn, the same year.
- Too broad to call solved or unsolved.
- Yes under one reading (Gleason and others). Under another it becomes the Hilbert-Smith conjecture, still open.
- Probability got its axioms from Kolmogorov in 1933. The rest depends on how you read it. A 2025 paper by Deng, Hani and Ma claims the classical part.
- Yes. The Gelfond-Schneider theorem.
- Open. A proof of the Riemann hypothesis was claimed on 20 November 2026 and is being checked. Goldbach and twin primes are still open.
- Open. Artin settled the abelian case.
- Impossible. Matiyasevich showed no such algorithm exists.
- Hasse, then Witt.
- Open, with partial results from Shimura and others.
- For continuous functions, Kolmogorov and Arnold answered it. Some argue Hilbert meant algebraic functions.
- No in general. Zariski proved the small cases, and Nagata gave the first counterexample.
- A lot of progress, and no agreement that it's finished.
- Open, even for curves of degree 8.
- Yes. Emil Artin.
- Bieberbach, Reinhardt, then Hales by computer, later machine-checked.
- Yes. De Giorgi and, separately, Nash.
- Open in general, solved in many cases.
- Yes for one formulation (Plemelj), no for the stricter one (Bolibrukh).
- Open, with the uniformization theorem for Riemann surfaces as a partial result.
- It’s a research plan with no single question to answer.