Hilbert’s 23 Problems: Which Are Solved in 2026?

Quick answer: Hilbert’s 23 problems are a list David Hilbert presented in 1900 to guide 20th-century mathematics. As of 2026, most are resolved or partly resolved, some are too vague to be fully settled, and a few remain open. The eighth includes the Riemann Hypothesis, for which a Lean-verified proof by Levent Alpöge was certified by the Lean and Mathlib communities on November 21, 2026, while Clay still lists it as unsolved pending its own process. In 2025, Deng, Hani and Ma resolved a major part of the sixth problem.

On August 8, 1900, at the International Congress of Mathematicians in Paris, David Hilbert gave a lecture that set the agenda for a century. He presented 10 problems in the talk and 23 in the published version. Many shaped whole fields; some are still open today.

Status of All 23 Problems (Checked November 2026)

#TopicStatus
1Continuum hypothesisIndependent of ZFC, assuming ZFC is consistent (Gödel 1940, Cohen 1963)
2Consistency of arithmeticIf Peano arithmetic is consistent, it cannot prove its own consistency (Gödel); Gentzen (1936) proved it using stronger methods
3Equal-volume polyhedra by dissectionSolved: no (Dehn, 1900)
4Geometries where lines are shortest pathsBroad formulation; substantial precise versions solved (Pogorelov and others)
5Lie groups without differentiabilitySolved (Gleason, Montgomery–Zippin, 1952)
6Axiomatizing physicsPartly resolved; in 2025 fluid equations were derived from hard-sphere dynamics through Boltzmann theory, under stated assumptions
7Transcendence of \(a^b\)Solved (Gelfond–Schneider, 1934)
8Prime numbers, including the Riemann Hypothesis and GoldbachRH: Lean-verified proof certified by the Lean/Mathlib communities on November 21, 2026; Clay still lists it as unsolved. Goldbach and twin primes: open
9General reciprocity lawSolved for abelian extensions (Artin reciprocity, class field theory); non-abelian case open
10Algorithm for Diophantine equationsSolved: no such algorithm (Matiyasevich, 1970)
11Quadratic forms over number fieldsSolved over number fields (Hasse–Minkowski); integral questions partly open
12Extending Kronecker–WeberOpen in general
13Solving degree-7 equations with two-variable functionsSolved for continuous functions (Kolmogorov, Arnold, 1957); algebraic version open
14Finiteness of invariant ringsSolved: no in general (Nagata, 1959)
15Rigorous Schubert calculusLargely solved
16Topology of curves and limit cyclesOpen
17Positive polynomials as sums of squares of rational functionsSolved (Artin, 1927)
18Crystallographic groups, tilings, packingLargely solved: Bieberbach (groups), Reinhardt (anisohedral tiles), Hales (equal-sphere packing, 1998; formal proof 2014)
19Analyticity of solutions in the calculus of variationsSolved (De Giorgi, Nash, 1957)
20Boundary value problemsLargely resolved
21Differential equations with given monodromyNegative for the strict Fuchsian formulation (Bolibrukh, 1989); positive for the broader regular-singular version
22Uniformization of analytic relationsPartly solved
23Calculus of variationsToo vague to settle

Problem 8 and the November 2026 News

Hilbert’s eighth problem includes the Riemann Hypothesis and the Goldbach conjecture. On November 20, 2026, Levent Alpöge released a Lean proof of the Riemann Hypothesis developed with Anthropic’s Claude, and on November 21 the Lean and Mathlib communities certified the statement and proof. The Clay Institute still lists RH as unsolved, since its prize process requires publication and a waiting period. Goldbach remains open.

The 2025 Breakthrough on Problem 6

Hilbert asked for mathematical foundations of physics, including deriving the motion of fluids from the motion of atoms. In 2025, Deng, Hani and Ma derived the Euler and Navier–Stokes equations from Newton’s laws for a hard-sphere gas. See our full explainer: Hilbert’s sixth problem.

Why Some Can Never Be “Solved”

Several problems (4, 6, 23) are programs rather than precise questions. Others were answered in surprising ways: problem 10 asked for an algorithm and the answer was that none can exist, and problem 1 turned out to be unprovable from the standard axioms, thanks to Gödel and Cohen.

Common Misconceptions

“Hilbert’s problems are the Millennium Prize Problems.” No. The Clay Institute’s seven problems (2000) are a separate list; only the Riemann Hypothesis appears on both.

Watch: Hilbert’s Problems in Video

If you learn better by watching, these videos are worth your time.

The hardest math problems of the 20th century: Hilbert’s 23 problems (Lex Clips). A conversation about Hilbert’s list and its legacy.
Math’s Fundamental Flaw (Veritasium). How Hilbert’s program led to Gödel and Turing.

Check Your Understanding

Five quick questions to see how much of this has stuck. Pick an answer and press Submit; you will see a short explanation either way.

Answer each question and press Submit to see your result right away.

1. In what year did Hilbert present his problems?
Found a bug? Let us know!
2. Which Hilbert problem includes the Riemann Hypothesis?
Found a bug? Let us know!
3. What was the answer to Hilbert’s tenth problem?
Found a bug? Let us know!
4. Which problem saw a major 2025 breakthrough on deriving fluids from particles?
Found a bug? Let us know!
5. Is the continuum hypothesis (problem 1) proved?
Found a bug? Let us know!

Frequently Asked Questions

What are Hilbert’s 23 problems?

They are 23 mathematical problems David Hilbert published in 1900, after presenting 10 of them at the International Congress of Mathematicians in Paris, to guide research in the 20th century.

How many of Hilbert’s problems are solved?

Most are resolved or partly resolved. A few remain open, including parts of the eighth (Goldbach, twin primes), the twelfth and the sixteenth, and some are too broad to be settled. The Riemann Hypothesis part of the eighth received a Lean-verified proof in November 2026.

Which Hilbert problems are still unsolved?

Problem 12 (extending Kronecker–Weber), problem 16 (limit cycles) and parts of problem 8 such as Goldbach are the best-known open ones. For the Riemann Hypothesis, a Lean-verified proof was certified by the Lean community on November 21, 2026, though Clay still lists it as unsolved.

What is Hilbert’s tenth problem?

It asked for an algorithm to decide whether any Diophantine equation has integer solutions. Matiyasevich, building on Davis, Putnam and Robinson, proved in 1970 that no such algorithm exists.

Keep Exploring

Sources and Further Reading

Related to This Article

What people say about "Hilbert’s 23 Problems: Which Are Solved in 2026? - Effortless Math"?

No one replied yet.

Leave a Reply