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

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.

ListNumber of problemsNumber unsolved or incompletely solvedProposed byProposed in
Hilbert's problems2313David Hilbert1900
Landau's problems44Edmund Landau1912
Taniyama's problems36Yutaka Taniyama1955
Thurston's 24 questions242William Thurston1982
Smale's problems1814Stephen Smale1998
Millennium Prize Problems76Clay Mathematics Institute2000
Simon problems15< 12Barry Simon2000
DARPA's math challenges23DARPA2007
Erdős's problems> 1212703Paul 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 to date:

The seventh problem, the Poincaré conjecture, was solved by Grigori Perelman in 2003. However, a generalization called the smooth four-dimensional Poincaré conjecture—that is, whether a four-dimensional topological sphere can have two or more inequivalent smooth structures—is unsolved.

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 ) {\displaystyle 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 ) {\displaystyle B(m,n)} are finite remains open.

Representation theory

Analysis

Combinatorics

  • The 1/3–2/3 conjecture – does every finite partially ordered set that is not totally ordered contain two elements x and y such that the probability that x appears before y in a random linear extension is between 1/3 and 2/3?
  • The Dittert conjecture concerning the maximum achieved by a particular function of matrices with real, nonnegative entries satisfying a summation condition
  • Problems in Latin squares – open questions concerning Latin squares
  • The lonely runner conjecture – if k {\displaystyle k} runners with pairwise distinct speeds run round a track of unit length, will every runner be "lonely" (that is, be at least a distance 1 / k {\displaystyle 1/k} from each other runner) at some time?
  • Map folding – various problems in map folding and stamp folding.
  • No-three-in-line problem – how many points can be placed in the n × n {\displaystyle n\times n} grid so that no three of them lie on a line?
  • Rudin's conjecture on the number of squares in finite arithmetic progressions
  • The sunflower conjecture – can the number of k {\displaystyle k} size sets required for the existence of a sunflower of r {\displaystyle r} sets be bounded by an exponential function in k {\displaystyle k} for every fixed r > 2 {\displaystyle r>2}?
  • Frankl's union-closed sets conjecture – for any family of sets closed under sums there exists an element (of the underlying space) belonging to half or more of the sets

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

  • Borsuk's problem on upper and lower bounds for the number of smaller-diameter subsets needed to cover a bounded n-dimensional set.
  • The covering problem of Rado: if the union of finitely many axis-parallel squares has unit area, how small can the largest area covered by a disjoint subset of squares be?
  • The Erdős–Oler conjecture: when n {\displaystyle n} is a triangular number, packing n − 1 {\displaystyle n-1} circles in an equilateral triangle requires a triangle of the same size as packing n {\displaystyle n} circles.
  • The disk covering problem about finding the smallest real number r ( n ) {\displaystyle r(n)} such that n {\displaystyle n} disks of radius r ( n ) {\displaystyle r(n)} can be arranged in such a way as to cover the unit disk.
  • The kissing number problem for dimensions other than 1, 2, 3, 4, 8 and 24
  • Reinhardt's conjecture: the smoothed octagon has the lowest maximum packing density of all centrally-symmetric convex plane sets
  • Sphere packing problems, including the density of the densest packing in dimensions other than 1, 2, 3, 8 and 24, and its asymptotic behavior for high dimensions.
  • Square packing in a square: what is the asymptotic growth rate of wasted space?
  • Ulam's packing conjecture about the identity of the worst-packing convex solid
  • The Tammes problem for numbers of nodes greater than 14 (except 24).

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 {\displaystyle 1.1<a\leq 10.76} governs the lower bound of a closed knot K {\displaystyle K}'s minimum ropelength L ( K ) ≥ a Cr ⁡ ( K ) 3 / 4 {\displaystyle L(K)\geq a\operatorname {Cr} (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, all of which share an edge with each other?
  • The Thomson problem – what is the minimum energy configuration of n {\displaystyle n} mutually-repelling particles on a unit sphere?
  • Convex uniform 5-polytopes – find and classify the complete set of these shapes

Non-Euclidean geometry

  • Hilbert's third problem for non-Euclidean geometries: in spherical or hyperbolic geometry, must polyhedra with the same volume and Dehn invariant be scissors-congruent?

Graph theory

Algebraic graph theory

Games on graphs

  • Does there exist a graph G {\displaystyle G} such that the dominating number γ ( G ) {\displaystyle \gamma (G)} equals the eternal dominating number γ {\displaystyle \gamma }∞( G ) {\displaystyle (G)} of G {\displaystyle G} and γ ( G ) {\displaystyle \gamma (G)} is less than the clique covering number of G {\displaystyle G}?
  • Graham's pebbling conjecture on the pebbling number of Cartesian products of graphs
  • Meyniel's conjecture that cop number is O ( n ) {\displaystyle O({\sqrt {n}})}
  • Suppose Alice has a winning strategy for the vertex coloring game on a graph G {\displaystyle G} with k {\displaystyle k} colors. Does she have one for k + 1 {\displaystyle k+1} colors?

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.
  • The 1-factorization conjecture that if n {\displaystyle n} is odd or even and k ≥ n , n − 1 {\displaystyle k\geq n,n-1}, respectively, then a k {\displaystyle k}-regular graph with 2 n {\displaystyle 2n} vertices is 1-factorable. The perfect 1-factorization conjecture that every complete graph on an even number of vertices admits a perfect 1-factorization.
  • Cereceda's conjecture on the diameter of the space of colorings of degenerate graphs
  • The Earth–Moon problem: what is the maximum chromatic number of biplanar graphs?
  • The Erdős–Faber–Lovász conjecture on coloring unions of cliques
  • The graceful tree conjecture that every tree admits a graceful labeling Rosa's conjecture that all triangular cacti are graceful or nearly-graceful
  • The Gyárfás–Sumner conjecture on χ-boundedness of graphs with a forbidden induced tree
  • The Hadwiger conjecture relating coloring to clique minors
  • The Hadwiger–Nelson problem on the chromatic number of unit distance graphs
  • Jaeger's Petersen-coloring conjecture: every bridgeless cubic graph has a cycle-continuous mapping to the Petersen graph
  • The list coloring conjecture: for every graph, the list chromatic index equals the chromatic index
  • The overfull conjecture that a graph with maximum degree Δ ( G ) ≥ n / 3 {\displaystyle \Delta (G)\geq n/3} is class 2 if and only if it has an overfull subgraph S {\displaystyle S} satisfying Δ ( S ) = Δ ( G ) {\displaystyle \Delta (S)=\Delta (G)}.
  • The total coloring conjecture of Behzad and Vizing that the total chromatic number is at most two plus the maximum degree

Graph drawing and embedding

Restriction of graph parameters

  • Does there exist a conference graph for every number of vertices v > 1 {\displaystyle v>1} where v ≡ 1 mod 4 {\displaystyle v\equiv 1{\bmod {4}}} and v {\displaystyle v} is an odd sum of two squares?
  • Conway's 99-graph problem: does there exist a strongly regular graph with parameters ( 99 , 14 , 1 , 2 ) {\displaystyle (99,14,1,2)}?
  • Degree diameter problem: given two positive integers d , k {\displaystyle d,k}, what is the largest graph of diameter k {\displaystyle k} such that all vertices have degrees at most d {\displaystyle d}?
  • Jørgensen's conjecture that every 6-vertex-connected K 6 {\displaystyle K_{6}}-minor-free graph is an apex graph
  • Does a Moore graph with girth 5 and degree 57 exist?
  • Do there exist infinitely many strongly regular geodetic graphs, or any strongly regular geodetic graphs that are not Moore graphs?

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 {\displaystyle \aleph _{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 {\displaystyle \aleph _{1}}-saturated models of a countable theory.
  • Shelah's categoricity conjecture for L ω 1 , ω {\displaystyle L_{\omega _{1},\omega }}: 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 λ {\displaystyle \lambda } there exists a cardinal μ ( λ ) {\displaystyle \mu (\lambda )} such that if an AEC K with LS(K)≤ λ {\displaystyle {}\leq \lambda } is categorical in a cardinal above μ ( λ ) {\displaystyle \mu (\lambda )} then it is categorical in all cardinals above μ ( λ ) {\displaystyle \mu (\lambda )}.
  • 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 {\displaystyle \aleph _{0}}, or 2 ℵ 0 {\displaystyle 2^{\aleph _{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 {\displaystyle \aleph _{\omega _{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 {\displaystyle \aleph _{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 Z p {\displaystyle \mathbb {Z} _{p}} decidable? of the field of polynomials over C {\displaystyle \mathbb {C} }?
  • 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

  • Bombieri–Lang conjecture: K {\displaystyle K}-rational points on a variety of general type over a number field K {\displaystyle K} are not a dense set in Zariski topology.
  • Erdős–Ulam problem: Is there a dense set of points in the plane all at rational distances from one another?
  • Manin conjecture: if K-rational points on Fano variety are Zariski-dense subset, then the distribution of points of height: H ( x ) ≤ B {\textstyle H(x)\leq B} in any Zariski-open subset U {\textstyle U} is proportional to B log ⁡ ( B ) r − 1 {\textstyle B\log(B)^{r-1}}, where r {\textstyle r} is rank of Picard group of that variety.
  • Sato–Tate conjecture: also a number of related conjectures that are generalizations of the original conjecture.
  • In Unit square: Rational dense problem: Is there a point in the plane at a rational distance from all four corners of a unit square?
  • Vojta's conjecture: points on non-singular algebraic variety over algebraic number field that not satisfy certain height inequality are contained in some Zariski-closed set.
  • n conjecture: a generalization of the abc conjecture to more than three integers. abc conjecture: for any ε > 0 {\displaystyle \varepsilon >0}, rad ⁡ ( a b c ) 1 + ε < c {\displaystyle \operatorname {rad} (abc)^{1+\varepsilon }<c} is true for only finitely many positive a , b , c {\displaystyle a,b,c} such that a + b = c {\displaystyle a+b=c}. Szpiro's conjecture: for any ε > 0 {\displaystyle \varepsilon >0}, there is some constant C ( ε ) {\displaystyle C(\varepsilon )} such that, for any elliptic curve E {\displaystyle E} defined over Q {\displaystyle \mathbb {Q} } with minimal discriminant Δ {\displaystyle \Delta } and conductor f {\displaystyle f}, we have | Δ | ≤ C ( ε ) ⋅ f 6 + ε {\displaystyle |\Delta |\leq C(\varepsilon )\cdot f^{6+\varepsilon }}.
  • Zilber–Pink conjecture that if X {\displaystyle X} is a mixed Shimura variety or semiabelian variety defined over C {\displaystyle \mathbb {C} }, and V ⊆ X {\displaystyle V\subseteq X} is a subvariety, then V {\displaystyle V} contains only finitely many maximal atypical subvarieties.

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

  • Beal's conjecture: for all integral solutions to A x + B y = C z {\displaystyle A^{x}+B^{y}=C^{z}} where x , y , z > 2 {\displaystyle x,y,z>2}, all three numbers A , B , C {\displaystyle A,B,C} must share some prime factor.
  • Brocard's problem: are there any integer solutions to n ! + 1 = m 2 {\displaystyle n!+1=m^{2}} other than n = 4 , 5 , 7 {\displaystyle n=4,5,7}?
  • Congruent number problem (a corollary to Birch and Swinnerton-Dyer conjecture, per Tunnell's theorem): determine precisely what rational numbers are congruent numbers.
  • Erdős–Moser problem: is 1 1 + 2 1 = 3 1 {\displaystyle 1^{1}+2^{1}=3^{1}} the only solution to the Erdős–Moser equation?
  • Erdős–Straus conjecture: for every n ≥ 2 {\displaystyle n\geq 2}, there are positive integers x , y , z {\displaystyle x,y,z} such that 4 / n = 1 / x + 1 / y + 1 / z {\displaystyle 4/n=1/x+1/y+1/z}.
  • Fermat–Catalan conjecture: there are finitely many distinct solutions ( a m , b n , c k ) {\displaystyle (a^{m},b^{n},c^{k})} to the equation a m + b n = c k {\displaystyle a^{m}+b^{n}=c^{k}} with a , b , c {\displaystyle a,b,c} being positive coprime integers and m , n , k {\displaystyle m,n,k} being positive integers satisfying 1 / m + 1 / n + 1 / k < 1 {\displaystyle 1/m+1/n+1/k<1}.
  • Goormaghtigh conjecture on solutions to ( x m − 1 ) / ( x − 1 ) = ( y n − 1 ) / ( y − 1 ) {\displaystyle (x^{m}-1)/(x-1)=(y^{n}-1)/(y-1)} where x > y > 1 {\displaystyle x>y>1} and m , n > 2 {\displaystyle m,n>2}.
  • The uniqueness conjecture for Markov numbers that every Markov number is the largest number in exactly one normalized solution to the Markov Diophantine equation.
  • Pillai's conjecture: for any A , B , C {\displaystyle A,B,C}, the equation A x m − B y n = C {\displaystyle Ax^{m}-By^{n}=C} has finitely many solutions when m , n {\displaystyle m,n} are not both 2 {\displaystyle 2}.
  • Which integers can be written as the sum of three perfect cubes?
  • Can every integer be written as a sum of four perfect cubes?

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.
  • Agoh–Giuga conjecture on the Bernoulli numbers that p {\displaystyle p} is prime if and only if p B p − 1 ≡ − 1 ( mod p ) {\displaystyle pB_{p-1}\equiv -1{\pmod {p}}}
  • Agrawal's conjecture that given coprime positive integers n {\displaystyle n} and r {\displaystyle r}, if ( X − 1 ) n ≡ X n − 1 ( mod n , X r − 1 ) {\displaystyle (X-1)^{n}\equiv X^{n}-1{\pmod {n,X^{r}-1}}}, then either n {\displaystyle n} is prime or n 2 ≡ 1 ( mod r ) {\displaystyle n^{2}\equiv 1{\pmod {r}}}
  • Artin's conjecture on primitive roots that if an integer is neither a perfect square nor − 1 {\displaystyle -1}, then it is a primitive root modulo infinitely many prime numbers p {\displaystyle p}
  • Brocard's conjecture: there are always at least 4 {\displaystyle 4} prime numbers between consecutive squares of prime numbers, aside from 2 2 {\displaystyle 2^{2}} and 3 2 {\displaystyle 3^{2}}.
  • Bunyakovsky conjecture: if an integer-coefficient polynomial f {\displaystyle f} has a positive leading coefficient, is irreducible over the integers, and has no common factors over all f ( x ) {\displaystyle f(x)} where x {\displaystyle x} is a positive integer, then f ( x ) {\displaystyle f(x)} is prime infinitely often.
  • Catalan's Mersenne conjecture: some Catalan–Mersenne number is composite and thus all Catalan–Mersenne numbers are composite after some point.
  • Dickson's conjecture: for a finite set of linear forms a 1 + b 1 n , … , a k + b k n {\displaystyle a_{1}+b_{1}n,\ldots ,a_{k}+b_{k}n} with each b i ≥ 1 {\displaystyle b_{i}\geq 1}, there are infinitely many n {\displaystyle n} for which all forms are prime, unless there is some congruence condition preventing it.
  • Dubner's conjecture: every even number greater than 4208 {\displaystyle 4208} is the sum of two primes which both have a twin.
  • Elliott–Halberstam conjecture on the distribution of prime numbers in arithmetic progressions.
  • Erdős–Mollin–Walsh conjecture: no three consecutive numbers are all powerful.
  • Feit–Thompson conjecture: for all distinct prime numbers p {\displaystyle p} and q {\displaystyle q}, ( p q − 1 ) / ( p − 1 ) {\displaystyle (p^{q}-1)/(p-1)} does not divide ( q p − 1 ) / ( q − 1 ) {\displaystyle (q^{p}-1)/(q-1)}
  • Fortune's conjecture that no Fortunate number is composite.
  • The Gaussian moat problem: is it possible to find an infinite sequence of distinct Gaussian prime numbers such that the difference between consecutive numbers in the sequence is bounded?
  • Gillies' conjecture on the distribution of prime divisors of Mersenne numbers.
  • Landau's problems Goldbach conjecture: all even natural numbers greater than 2 {\displaystyle 2} are the sum of two prime numbers. Legendre's conjecture: for every positive integer n {\displaystyle n}, there is a prime between n 2 {\displaystyle n^{2}} and ( n + 1 ) 2 {\displaystyle (n+1)^{2}}. Twin prime conjecture: there are infinitely many twin primes. Are there infinitely many primes of the form n 2 + 1 {\displaystyle n^{2}+1}?
  • Problems associated to Linnik's theorem
  • New Mersenne conjecture: for any odd natural number p {\displaystyle p}, if any two of the three conditions p = 2 k ± 1 {\displaystyle p=2^{k}\pm 1} or p = 4 k ± 3 {\displaystyle p=4^{k}\pm 3}, 2 p − 1 {\displaystyle 2^{p}-1} is prime, and ( 2 p + 1 ) / 3 {\displaystyle (2^{p}+1)/3} is prime are true, then the third condition is also true.
  • Polignac's conjecture: for all positive even numbers n {\displaystyle n}, there are infinitely many prime gaps of size n {\displaystyle n}.
  • Schinzel's hypothesis H that for every finite collection { f 1 , … , f k } {\displaystyle \{f_{1},\ldots ,f_{k}\}} of nonconstant irreducible polynomials over the integers with positive leading coefficients, either there are infinitely many positive integers n {\displaystyle n} for which f 1 ( n ) , … , f k ( n ) {\displaystyle f_{1}(n),\ldots ,f_{k}(n)} are all primes, or there is some fixed divisor m > 1 {\displaystyle m>1} which, for all n {\displaystyle n}, divides some f i ( n ) {\displaystyle f_{i}(n)}.
  • Selfridge's conjecture: is 78,557 the lowest Sierpiński number?
  • Does the converse of Wolstenholme's theorem hold for all natural numbers?
  • Are all Euclid numbers square-free?
  • Are all Fermat numbers square-free?
  • Are all Mersenne numbers of prime index square-free?
  • Are there any composite c satisfying 2c − 1 ≡ 1 (mod c2)?
  • Are there any Wall–Sun–Sun primes?
  • Are there any Wieferich primes in base 47?
  • Are there infinitely many balanced primes?
  • Are there infinitely many cluster primes?
  • Are there infinitely many cousin primes?
  • Are there infinitely many Cullen primes?
  • Are there infinitely many Euclid primes?
  • Are there infinitely many Fibonacci primes?
  • Are there infinitely many Kummer primes?
  • Are there infinitely many Kynea primes?
  • Are there infinitely many Lucas primes?
  • Are there infinitely many Mersenne primes (Lenstra–Pomerance–Wagstaff conjecture); equivalently, infinitely many even perfect numbers?
  • Are there infinitely many Newman–Shanks–Williams primes?
  • Are there infinitely many palindromic primes to every base?
  • Are there infinitely many Pell primes?
  • Are there infinitely many Pierpont primes?
  • Are there infinitely many prime quadruplets?
  • Are there infinitely many prime triplets?
  • Siegel's conjecture: are there infinitely many regular primes, and if so is their natural density as a subset of all primes e − 1 / 2 {\displaystyle e^{-1/2}}?
  • Are there infinitely many sexy primes?
  • Are there infinitely many safe and Sophie Germain primes?
  • Are there infinitely many Wagstaff primes?
  • Are there infinitely many Wieferich primes?
  • Are there infinitely many Wilson primes?
  • Are there infinitely many Wolstenholme primes?
  • Are there infinitely many Woodall primes?
  • Can a prime p satisfy 2 p − 1 ≡ 1 ( mod p 2 ) {\displaystyle 2^{p-1}\equiv 1{\pmod {p^{2}}}} and 3 p − 1 ≡ 1 ( mod p 2 ) {\displaystyle 3^{p-1}\equiv 1{\pmod {p^{2}}}} simultaneously?
  • Does every prime number appear in the Euclid–Mullin sequence?
  • What is the smallest Skewes's number?
  • For any given integer a > 0, are there infinitely many Lucas–Wieferich primes associated with the pair (a, −1)? (Specially, when a = 1, this is the Fibonacci-Wieferich primes, and when a = 2, this is the Pell-Wieferich primes)
  • For any given integer a > 0, are there infinitely many primes p such that ap − 1 ≡ 1 (mod p2)?
  • For any given integer b which is not a perfect power and not of the form −4k4 for integer k, are there infinitely many repunit primes to base b?
  • For any given integers k ≥ 1 , b ≥ 2 , c ≠ 0 {\displaystyle k\geq 1,b\geq 2,c\neq 0}, with gcd(k, c) = 1 and gcd(b, c) = 1, are there infinitely many primes of the form ( k × b n + c ) / gcd ( k + c , b − 1 ) {\displaystyle (k\times b^{n}+c)/\gcd(k+c,b-1)} with integer n ≥ 1?
  • Is every Fermat number 2 2 n + 1 {\displaystyle 2^{2^{n}}+1} composite for n > 4 {\displaystyle n>4}?
  • Is 509,203 the lowest Riesel number?

Set theory

Note: 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 1995

Ricci flow, here illustrated with a 2D manifold, was the key tool in Grigori Perelman's solution of the Poincaré conjecture.

Algebra

Analysis

Combinatorics

Dynamical systems

Game theory

Geometry

21st century

20th century

Graph theory

Group theory

Number theory

21st century

20th century

Ramsey theory

Theoretical computer science

Topology

Uncategorised

2010s

2000s

See also

Notes

Further reading

Books discussing problems solved since 1995

Books discussing unsolved problems

External links