List of unsolved problems in mathematics

Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, mathematical logic, number theory, set theory, Ramsey theory, dynamical systems, and partial differential equations. Some problems belong to more than one discipline and are studied using techniques from different areas. Prizes are often awarded for the solution to a long-standing problem, and some lists of unsolved problems, such as the Millennium Prize Problems, receive considerable attention.

This list is a composite of notable unsolved problems mentioned in previously published lists, including but not limited to lists considered authoritative, and the problems listed here vary widely in both difficulty and importance.

Notable lists

For over a century, various mathematicians and organizations have published and promoted lists of unsolved mathematical problems. In some cases, the lists have been associated with prizes for the discoverers of solutions, with the Millennium Prize Problems each containing a reward of one million dollars.

ListNumber of
problems
Number unsolved
or incompletely solved
Proposed byProposed
in
Hilbert's problems2313David Hilbert1900
Landau's problems44Edmund Landau1912
Taniyama's problems36–Yutaka Taniyama1955
Thurston's 24 questions242William Thurston1982
Smale's problems1814Stephen Smale1998
Millennium Prize Problems76[when?]Clay Mathematics Institute2000
Simon problems1512Barry Simon2000
DARPA's math challenges23–DARPA2007
Erdős's problems≥ 1221635Paul ErdősOver six decades of Erdős' career, from the 1930s to 1990s
The Riemann zeta function, subject of the Riemann hypothesis

Millennium Prize Problems

Of the original seven Millennium Prize Problems listed by the Clay Mathematics Institute in 2000, six remain unsolved as of October 2026:

The seventh problem, the Poincaré conjecture, was solved by Grigori Perelman in 2003.

Contrary to most of the Hilbert problems and many other problems described in this article which allow for varying interpretations, the Millennium Prize problems are precisely described to provide clear conditions to award winners. After Perelman's resolution of the Poincaré conjecture, the official descriptions of the remaining six problems were codified by six specialists and released publicly. While the problems can touch upon greater research topics, and can themselves be only special cases of more general open problems, the Clay Institute decided upon these particular cases of the problems:

  • The Poincaré conjecture can be formulated in terms of the generalized Poincaré conjecture for different categories of manifolds. In the category of piecewise linear manifolds, the generalized conjecture is still an open problem for 4-dimensional manifolds. For differential manifolds, it is known to be false generally, but it is an open problem to determine in which dimensions it is true. In other words, it is not yet fully known on which spheres there exist no exotic smooth structures. The Millennium Prize was offered for the topological version of the conjecture, that remained open only for 3-dimensional manifolds during the publication of the list.
  • The Birch and Swinnerton-Dyer conjecture can be formulated for elliptic curves over any number field, and generalizations for more general arithmetic objects have been proposed. The Millennium Prize is offered for resolving the conjecture for elliptic curves over rational numbers.
  • The Navier–Stokes equations have a general form that can take into account many physical phenomena including the difference between volume viscosity and dynamic viscosity, compressible flow, change of viscosities in the flow, and an external force. The Millennium Prize is offered for proving any one of four statements, two of which deal with the Navier–Stokes equations with no external force while the other two deal with the Navier–Stokes equations with a smooth external force.
  • The Riemann hypothesis has many generalizations for different types of L-functions that are expected to be true. The Millennium Prize problem is offered for showing the original Riemann hypothesis for the Riemann zeta function.

Notebooks

  • The Kourovka Notebook (Russian: Коуровская тетрадь) is a collection of unsolved problems in group theory, first published in 1965 and updated many times since.
  • The Sverdlovsk Notebook (Russian: Свердловская тетрадь) is a collection of unsolved problems in semigroup theory, first published in 1965 and updated every 2 to 4 years since.
  • The Dniester Notebook (Russian: Днестровская тетрадь) lists several hundred unsolved problems in algebra, particularly ring theory and modulus theory.
  • The Erlagol Notebook (Russian: Эрлагольская тетрадь) lists unsolved problems in algebra and model theory.

Unsolved problems

Algebra

In the Bloch sphere representation of a qubit, a SIC-POVM forms a regular tetrahedron. Zauner conjectured that analogous structures exist in complex Hilbert spaces of all finite dimensions.

Group theory

The free Burnside group B(2,3) is finite; in its Cayley graph, shown here, each of its 27 elements is represented by a vertex. The question of which other groups B(m,n) are finite remains open.

Representation theory

Analysis

Combinatorics

Dynamical systems

A detail of the Mandelbrot set. It is not known whether the Mandelbrot set is locally connected or not.

Games and puzzles

Combinatorial games

Games with imperfect information

Geometry

Algebraic geometry

Covering and packing

Differential geometry

Discrete geometry

In three dimensions, the kissing number is 12, because 12 non-overlapping unit spheres can be put into contact with a central unit sphere. (Here, the centers of outer spheres form the vertices of a regular icosahedron.) Kissing numbers are only known exactly in dimensions 1, 2, 3, 4, 8 and 24.

Euclidean geometry

  • Are the two Meissner tetrahedra the minimum-volume three-dimensional shapes of constant width?
  • Moser's worm problem – what is the smallest area of a shape that can cover every unit-length curve in the plane?
  • The moving sofa problem – what is the largest area of a shape that can be maneuvered through a unit-width L-shaped corridor?
  • In parallelohedron:
    • Can every spherical non-convex polyhedron that tiles space by translation have its faces grouped into patches with the same combinatorial structure as a parallelohedron?
    • Does every higher-dimensional tiling by translations of convex polytope tiles have an affine transformation taking it to a Voronoi diagram?
  • Ropelength problems:
    • Is there a general expression for the minimum ropelength of an arbitrary closed knot?
    • What constant 1.1<a≤10.76 governs the lower bound of a closed knot K's minimum ropelength L(K)≥aCr⁡(K)3/4?
    • Is the upper bound of a closed knot's minimum ropelength linear to its crossing number?
    • Is there a general expression for how much the ends of a long rope of radius 1 get closer when a tight open knot is tied into it?
  • Does every convex polyhedron have Rupert's property?
  • Shephard's problem (a.k.a. Dürer's conjecture) – does every convex polyhedron have a net, or simple edge-unfolding?
  • Is there a non-convex polyhedron without self-intersections with more than seven faces, each of which shares exactly one edge with each other?
  • The Thomson problem – what is the minimum energy configuration of n mutually-repelling particles on a unit sphere?
  • Convex uniform 5-polytopes – find and classify the complete set of these shapes

Non-Euclidean geometry

Graph theory

Algebraic graph theory

Games on graphs

Graph coloring and labeling

An instance of the Erdős–Faber–Lovász conjecture: a graph formed from four cliques of four vertices each, any two of which intersect in a single vertex, can be four-colored.

Graph drawing and embedding

Restriction of graph parameters

Subgraphs

Word-representation of graphs

Miscellaneous graph theory

Model theory and formal languages

  • The Cherlin–Zilber conjecture: A simple group whose first-order theory is stable in ℵ0 is a simple algebraic group over an algebraically closed field.
  • Generalized star height problem: can all regular languages be expressed using generalized regular expressions with limited nesting depths of Kleene stars?
  • For which number fields does Hilbert's tenth problem hold?
  • Kueker's conjecture
  • The main gap conjecture, e.g. for uncountable first order theories, for AECs, and for ℵ1-saturated models of a countable theory.
  • Shelah's categoricity conjecture for Lω1,ω: If a sentence is categorical above the Hanf number then it is categorical in all cardinals above the Hanf number.
  • Shelah's eventual categoricity conjecture: For every cardinal λ there exists a cardinal μ(λ) such that if an AEC K with LS(K)≤λ is categorical in a cardinal above μ(λ) then it is categorical in all cardinals above μ(λ).
  • The stable field conjecture: every infinite field with a stable first-order theory is separably closed.
  • The stable forking conjecture for simple theories
  • Tarski's exponential function problem: is the theory of the real numbers with the exponential function decidable?
  • The universality problem for C-free graphs: For which finite sets C of graphs does the class of C-free countable graphs have a universal member under strong embeddings?
  • The universality spectrum problem: Is there a first-order theory whose universality spectrum is minimum?
  • Vaught conjecture: the number of countable models of a first-order complete theory in a countable language is either finite, ℵ0, or 2ℵ0.
  • Assume K is the class of models of a countable first order theory omitting countably many types. If K has a model of cardinality ℵω1 does it have a model of cardinality continuum?
  • Do the Henson graphs have the finite model property?
  • Does a finitely presented homogeneous structure for a finite relational language have finitely many reducts?
  • Does there exist an o-minimal first order theory with a trans-exponential (rapid growth) function?
  • If the class of atomic models of a complete first order theory is categorical in the ℵn, is it categorical in every cardinal?
  • Is every infinite, minimal field of characteristic zero algebraically closed? (Here, "minimal" means that every definable subset of the structure is finite or co-finite.)
  • Is the Borel monadic theory of the real order (BMTO) decidable? Is the monadic theory of well-ordering (MTWO) consistently decidable?
  • Is the theory of the field of Laurent series over ℤp decidable? of the field of polynomials over ℂ?
  • Is there a logic L which satisfies both the Beth property and Δ-interpolation, is compact but does not satisfy the interpolation property?
  • Determine the structure of Keisler's order.
  • What is the nature of the proof-theoretic ordinal (the smallest ordinal a theory cannot prove well-founded) for second-order arithmetic, ZFC, or stronger theories?

Probability theory

Number theory

General

6 is a perfect number because it is the sum of its proper positive divisors, 1, 2 and 3. It is not known how many perfect numbers there are, nor if any of them is odd.

Additive number theory

Algebraic number theory

Analytic number theory

Arithmetic geometry

Computational number theory

Diophantine approximation and transcendental number theory

The area of the blue region converges to the Euler–Mascheroni constant, which may or may not be a rational number.

Diophantine equations

Prime numbers

Goldbach's conjecture states that all even integers greater than 2 can be written as the sum of two primes. Here this is illustrated for the even integers from 4 to 28.

Set theory

The following conjectures are expressed in the first-order language of axiomatic set theory and, unless stated otherwise, are here taken to be over Zermelo-Frankel set theory, possibly with Choice. In particular, the conjecture's independence may not be open in set theories with a wider or conflicting class of models, such as the various constructive resp. non-wellfounded set theories, etc.

Topology

The unknotting problem asks whether there is an efficient algorithm to identify when the shape presented in a knot diagram is actually the unknot.

Problems solved since 2015

The Einstein problem asks whether aperiodic monotiles, like the Tile(1,1) pictured here, exist.

Algebra

Group theory

  • Existence of a non-sofic, discrete, countable group (solution in an anonymized paper published by OpenAI, 2026).
  • Umbral moonshine conjecture (John F. R. Duncan, Michael J. Griffin, Ken Ono, 2015).

Analysis

Combinatorics

Dynamical systems

Game theory

Geometry

Graph theory

  • Disproof of Jaeger's Petersen-coloring conjecture: every bridgeless cubic graph has a cycle-continuous mapping to the Petersen graph (NeuralReformist (July 2026); Jan Goedgebeur, Jorik Jooken, Edita Máčajová, Davide Mattiolo, Giuseppe Mazzuoccolo, and Nikolay Ulyanov, August 2026).

Number theory

Ramsey theory

Theoretical computer science

Topology

See also