List of unsolved problems in mathematics

Since the Renaissance, every century has seen the so- 2.1 Algebra
lution of more mathematical problems than the century
before, and yet many mathematical problems, both ma- • Homological conjectures in commutative algebra
jor and minor, still remain unsolved.[1] Prizes are often
awarded for the solution to a long-standing problem, and • Hilbert’s sixteenth problem
lists of unsolved problems (such as the list of Millennium
Prize Problems) receive considerable attention. Unsolved • Hilbert’s fifteenth problem
problems remain in multiple domains, including physics,
computer science, algebra, additive and algebraic number • Hadamard conjecture
theories, analysis, combinatorics, algebraic, discrete and
Euclidean geometries, graph, group, model, number, set • Jacobson’s conjecture
and Ramsey theories, dynamical systems, partial differ-
ential equations, and miscellaneous unsolved problems. • Existence of perfect cuboids and associated cuboid
conjectures

• Zauner’s conjecture: existence of SIC-POVMs in all

1 Lists of unsolved problems in dimensions
mathematics
• Wild Problem: Classification of pairs of n×n ma-
Over the course of time, several lists of unsolved mathe- trices under simultaneous conjugation and problems
matical problems have appeared. containing it such as a lot of classification problems

• Köthe conjecture
1.1 Millennium Prize Problems
• Birch–Tate conjecture
Of the original seven Millennium Prize Problems set by
the Clay Mathematics Institute in 2000, six have yet to be • Serre’s conjecture II
solved, as of 2017:[10]
• Bombieri–Lang conjecture

• P versus NP • Farrell–Jones conjecture

• Hodge conjecture • Bost conjecture
• Riemann hypothesis
• Uniformity conjecture
• Yang–Mills existence and mass gap
• Kaplansky’s conjecture
• Navier–Stokes existence and smoothness
• Kummer–Vandiver conjecture
• Birch and Swinnerton-Dyer conjecture
• Serre’s multiplicity conjectures
The seventh problem, the Poincaré conjecture, has been
solved.[11] The smooth four-dimensional Poincaré con- • Pierce–Birkhoff conjecture
jecture—that is, whether a four-dimensional topological
sphere can have two or more inequivalent smooth struc- • Eilenberg–Ganea conjecture
tures—is still unsolved.[12]
• Green’s conjecture

• Grothendieck–Katz p-curvature conjecture

2 Unsolved problems
• Sendov’s conjecture

1
2 2 UNSOLVED PROBLEMS

2.2 Algebraic geometry • Frankl’s union-closed sets conjecture: for any family
of sets closed under sums there exists an element (of
• Bass conjecture the underlying space) belonging to half or more of
the sets
• Deligne conjecture
• Fröberg conjecture • The lonely runner conjecture: if k + 1 runners with
pairwise distinct speeds run round a track of unit
• Fujita conjecture length, will every runner be “lonely” (that is, be at
• Hartshorne conjectures least a distance 1/(k + 1) from each other runner)
at some time?
• The Jacobian conjecture
• Singmaster’s conjecture: is there a finite upper
• Manin conjecture bound on the multiplicities of the entries greater
• Nakai conjecture than 1 in Pascal’s triangle?

• Resolution of singularities in characteristic p • The 1/3–2/3 conjecture: does every finite partially
ordered set that is not totally ordered contain two
• Standard conjectures on algebraic cycles
elements x and y such that the probability that x ap-
• Section conjecture pears before y in a random linear extension is be-
tween 1/3 and 2/3?
• Tate conjecture
• Virasoro conjecture • unicity conjecture for Markov numbers

• Zariski multiplicity conjecture • Give a combinatorial interpretation of the

Kronecker coefficients.

2.3 Analysis
• Schanuel’s conjecture and four exponentials conjec- 2.5 Discrete geometry
ture
• Solving the happy ending problem for arbitrary n
• Lehmer’s conjecture
• Finding matching upper and lower bounds for k-sets
• Pompeiu problem
and halving lines
• Are γ (the Euler–Mascheroni constant), π + e, π − e,
2
πe, π/e, πe , π√2 , ππ , eπ , ln π, 2e , ee , Catalan’s con- • The Hadwiger conjecture on covering n-dimensional
stant or Khinchin’s constant rational, algebraic irra- convex bodies with at most 2n smaller copies
tional, or transcendental? What is the irrationality
measure of each of these numbers?[13][14][15] • The Kobon triangle problem on triangles in line ar-
rangements
• Khabibullin’s conjecture on integral inequalities
• Hilbert’s thirteenth problem • The McMullen problem on projectively transform-
ing sets of points into convex position
• Vitushkin’s conjecture
• Ulam’s packing conjecture about the identity of the
worst-packing convex solid
2.4 Combinatorics
• Number of magic squares (sequence A006052 in the • Filling area conjecture
OEIS)
• Hopf conjecture
• Number of magic tori (sequence A270876 in the
OEIS) • Kakeya conjecture
• Finding a formula for the probability that two el-
• Kissing number problem for dimensions other than
ements chosen at random generate the symmetric
1, 2, 3, 4, 8 and 24
group Sn
• Finding a formula for the number of self-avoiding • How many unit distances can be determined by a set
random walks with a given number of steps. of n points? (see Counting unit distances)
2.8 Graph theory 3

2.6 Euclidean geometry • Furstenberg conjecture – Is every invariant and

ergodic measure for the ×2, ×3 action on the cir-
• The einstein problem – does there exist a two- cle either Lebesgue or atomic?
dimensional shape that forms the prototile for an
aperiodic tiling, but not for any periodic tiling?[16] • Margulis conjecture — Measure classification for
diagonalizable actions in higher-rank groups
• Inscribed square problem – does every Jordan curve
have an inscribed square?[17] • MLC conjecture – Is the Mandelbrot set locally con-
nected?
• Moser’s worm problem – what is the smallest area
of a shape that can cover every unit-length curve in • Weinstein conjecture – Does a regular compact
the plane?[18] contact type level set of a Hamiltonian on a
symplectic manifold carry at least one periodic orbit
• The moving sofa problem – what is the largest area of the Hamiltonian flow?
of a shape that can be maneuvered through a unit-
width L-shaped corridor?[19] • Is every reversible cellular automaton in three or
more dimensions locally reversible?[23]
• Shephard’s problem (a.k.a. Dürer’s conjecture) –
does every convex polyhedron have a net?[20] • Many problems concerning an outer billiard, for ex-
• The Thomson problem – what is the minimum en- ample show that outer billiards relative to almost ev-
ergy configuration of N particles bound to the sur- ery convex polygon has unbounded orbits.
face of a unit sphere that repel each other with a 1/r
potential (or any potential in general)?
2.8 Graph theory
• Pentagonal tiling – 15 types of convex pentagons are
known to monohedrally tile the plane, and it is not 2.8.1 Paths and cycles in graphs
known whether this list is complete.[21]
• Barnette’s conjecture that every cubic bipartite
• Falconer’s conjecture three-connected planar graph has a Hamiltonian
cycle[24]
• g-conjecture
• Circle packing in an equilateral triangle • Chvátal’s toughness conjecture, that there is a num-
ber t such that every t-tough graph is Hamiltonian[25]
• Circle packing in an isosceles right triangle
• The cycle double cover conjecture that every bridge-
• Lebesgue’s universal covering problem – what is the less graph has a family of cycles that includes each
convex shape in the plane of least area which pro- edge twice[26]
vides an isometric cover for any shape of diameter
one? • The Erdős–Gyárfás conjecture on cycles with
power-of-two lengths in cubic graphs[27]
• Bellman’s lost in a forest problem – for a given shape
of forest find the shortest escape path which will in- • The linear arboricity conjecture on decomposing
tersect the edge of the forest at some point for any graphs into disjoint unions of paths according to
given starting point and direction inside the forest. their maximum degree[28]

• Find the complete set of uniform 5-polytopes[22] • The Lovász conjecture on Hamiltonian paths in
symmetric graphs[29]
• Covering problem of Rado
• The strong bellows conjecture – must the Dehn in-
2.8.2 Graph coloring and labeling
variant of a self-intersection free flexible polyhedron
stay constant as it flexes? • The Erdős–Faber–Lovász conjecture on coloring
unions of cliques[30]
2.7 Dynamical systems • The Hadwiger conjecture relating coloring to clique
minors[31]
• Lyapunov’s second method for stability – For what
classes of ODEs, describing dynamical systems, • The Hadwiger–Nelson problem on the chromatic
does the Lyapunov’s second method formulated in number of unit distance graphs[32]
the classical and canonically generalized forms de-
fine the necessary and sufficient conditions for the • Hedetniemi’s conjecture on the chromatic number
(asymptotical) stability of motion? of tensor products of graphs[33]
4 2 UNSOLVED PROBLEMS

• Jaeger’s Petersen-coloring conjecture that every • What is the largest possible pathwidth of an n-vertex
bridgeless cubic graph has a cycle-continuous map- cubic graph?
ping to the Petersen graph[34]
• The reconstruction conjecture and new digraph
• The list coloring conjecture that, for every graph, the reconstruction conjecture on whether a graph is
list chromatic index equals the chromatic index[35] uniquely determined by its vertex-deleted sub-
graphs.
• The Ringel–Kotzig conjecture on graceful labeling
of trees[36] • Sumner’s conjecture: does every (2n − 2) -vertex
tournament contain as a subgraph every n -vertex
• The total coloring conjecture of Behzad and Vizing oriented tree?[49]
that the total chromatic number is at most two plus
the maximum degree[37] • Tutte’s conjectures that every bridgeless graph has a
nowhere-zero 5-flow and every Petersen-minor-free
bridgeless graph has a nowhere-zero 4-flow
2.8.3 Graph drawing
• Vizing’s conjecture on the domination number of
• The Albertson conjecture that the crossing number cartesian products of graphs[50]
can be lower-bounded by the crossing number of a
complete graph with the same chromatic number[38]
2.9 Group theory
• The Blankenship–Oporowski conjecture on the
book thickness of subdivisions[39] • Is every finitely presented periodic group finite?

• Conway’s thrackle conjecture[40] • The inverse Galois problem: is every finite group the
Galois group of a Galois extension of the rationals?
• Harborth’s conjecture that every planar graph can be
drawn with integer edge lengths[41] • For which positive integers m, n is the free Burnside
group B(m,n) finite? In particular, is B(2, 5) finite?
• Negami’s conjecture on projective-plane embed-
dings of graphs with planar covers[42] • Is every group surjunctive?

• The strong Papadimitriou–Ratajczak conjecture • Andrews–Curtis conjecture

that every polyhedral graph has a convex greedy
embedding[43] • Herzog–Schönheim conjecture

• Turán’s brick factory problem – Is there a drawing • Does generalized moonshine exist?
of any complete bipartite graph with fewer crossings • Are there an infinite number of Leinster Groups?
than the number given by Zarankiewicz?[44]

• Universal point sets of subquadratic size for planar 2.10 Model theory
graphs[45]
• Vaught’s conjecture
2.8.4 Miscellaneous graph theory • The Cherlin–Zilber conjecture: A simple group
whose first-order theory is stable in ℵ0 is a simple
• The Erdős–Hajnal conjecture on large cliques or in- algebraic group over an algebraically closed field.
dependent sets in graphs with a forbidden induced
subgraph[46] • The Main Gap conjecture, e.g. for uncountable
first order theories, for AECs, and for ℵ1 -saturated
• The implicit graph conjecture on the existence models of a countable theory.[51]
of implicit representations for slowly-growing
hereditary families of graphs[47] • Determine the structure of Keisler’s order[52][53]
• Jørgensen’s conjecture that every 6-vertex- • The stable field conjecture: every infinite field with
connected K 6 -minor-free graph is an apex graph[48] a stable first-order theory is separably closed.

• Deriving a closed-form expression for the • Is the theory of the field of Laurent series over Zp
percolation threshold values, especially pc (square decidable? of the field of polynomials over C ?
site)
• (BMTO) Is the Borel monadic theory of the real or-
• Does a Moore graph with girth 5 and degree 57 ex- der decidable? (MTWO) Is the monadic theory of
ist? well-ordering consistently decidable?[54]
2.11 Number theory 5

• The Stable Forking Conjecture for simple • Generalized Riemann hypothesis

theories[55] • Riemann hypothesis
• For which number fields does Hilbert’s tenth prob- • n conjecture
lem hold?
• abc conjecture (Proof claimed in 2012, cur-
• Assume K is the class of models of a countable first rently under review.)
order theory omitting countably many types. If K
has a model of cardinality ℵω1 does it have a model • Hilbert’s ninth problem
of cardinality continuum?[56]
• Hilbert’s eleventh problem
• Shelah’s eventual Categority conjecture: For every
• Hilbert’s twelfth problem
cardinal λ there exists a cardinal µ(λ) such that If
an AEC K with LS(K)<= λ is categorical in a cardi- • Carmichael’s totient function conjecture
nal above µ(λ) then it is categorical in all cardinals
above µ(λ) .[51][57] • Erdős–Straus conjecture

• Shelah’s categoricity conjecture for Lω1 ,ω : If a sen- • Pillai’s conjecture

tence is categorical above the Hanf number then • Hall’s conjecture
it is categorical in all cardinals above the Hanf
number.[51] • Lindelöf hypothesis
• Is there a logic L which satisfies both the Beth prop- • Montgomery’s pair correlation conjecture
erty and Δ-interpolation, is compact but does not
satisfy the interpolation property?[58] • Hilbert–Pólya conjecture

• If the class of atomic models of a complete first or- • Grimm’s conjecture

der theory is categorical in the ℵn , is it categorical • Leopoldt’s conjecture
in every cardinal?[59][60]
• Do any odd perfect numbers exist?
• Is every infinite, minimal field of characteristic zero
algebraically closed? (minimal = no proper elemen- • Are there infinitely many perfect numbers?
tary substructure)
• Do quasiperfect numbers exist?
• Kueker’s conjecture[61]
• Do any odd weird numbers exist?
• Does there exist an o-minimal first order theory with • Do any Lychrel numbers exist?
a trans-exponential (rapid growth) function?
• Is 10 a solitary number?
• Lachlan’s decision problem
• Catalan–Dickson conjecture on aliquot sequences
• Does a finitely presented homogeneous structure
for a finite relational language have finitely many • Do any Taxicab(5, 2, n) exist for n > 1?
reducts?
• Brocard’s problem: existence of integers, (n,m),
• Do the Henson graphs have the finite model prop- such that n! + 1 = m2 other than n = 4, 5, 7
erty? (e.g. triangle-free graphs)
• Beilinson conjecture
• The universality problem for C-free graphs: For
• Littlewood conjecture
which finite sets C of graphs does the class of C-
free countable graphs have a universal member un- • Szpiro’s conjecture
der strong embeddings?[62]
• Vojta’s conjecture
• The universality spectrum problem: Is there a
first-order theory whose universality spectrum is • Goormaghtigh conjecture
minimum?[63]
• Congruent number problem (a corollary to Birch
and Swinnerton-Dyer conjecture, per Tunnell’s the-
2.11 Number theory orem)
• Lehmer’s totient problem: if φ(n) divides n − 1,
2.11.1 General must n be prime?
• Grand Riemann hypothesis • Are there infinitely many amicable numbers?
6 2 UNSOLVED PROBLEMS

• Are there any pairs of amicable numbers which have 2.11.3 Algebraic number theory
opposite parity?
• Are there infinitely many real quadratic number
• Are there any pairs of relatively prime amicable fields with unique factorization (Class number prob-
numbers? lem)?
• Are there infinitely many betrothed numbers? • Characterize all algebraic number fields that have
some power basis.
• Are there any pairs of betrothed numbers which
have same parity? • Stark conjectures (including Brumer–Stark conjec-
ture)
• The Gauss circle problem – how far can the number
of integer points in a circle centered at the origin be • Kummer–Vandiver conjecture
from the area of the circle?

• Piltz divisor problem, especially Dirichlet’s divisor 2.11.4 Combinatorial number theory
problem
• Singmaster’s conjecture: Is there a finite upper
• Exponent pair conjecture bound on the number of times that a number other
than 1 can appear in Pascal’s triangle?
• Is π a normal number (its digits are “random”)?[64]

• Casas-Alvero conjecture
2.11.5 Prime numbers
• Sato–Tate conjecture
• Catalan’s Mersenne conjecture
• Find value of De Bruijn–Newman constant
• Agoh–Giuga conjecture
• Which integers can be written as the sum of three
• The Gaussian moat problem: is it possible to find an
perfect cubes?[65]
infinite sequence of distinct Gaussian prime num-
• Erdős–Moser problem: is 11 + 21 = 31 the only so- bers such that the difference between consecutive
lution to the Erdős–Moser equation? numbers in the sequence is bounded?
• New Mersenne conjecture
2.11.2 Additive number theory
• Erdős–Mollin–Walsh conjecture
See also: Problems involving arithmetic progressions • Are there infinitely many prime quadruplets?
• Are there infinitely many cousin primes?
• Beal’s conjecture
• Are there infinitely many sexy primes?
• Fermat–Catalan conjecture • Are there infinitely many Mersenne primes
• Goldbach’s conjecture (Lenstra–Pomerance–Wagstaff conjecture); equiv-
alently, infinitely many even perfect numbers?
• The values of g(k) and G(k) in Waring’s problem
• Are there infinitely many Wagstaff primes?
• Collatz conjecture (3n + 1 conjecture)
• Are there infinitely many Sophie Germain primes?
• Lander, Parkin, and Selfridge conjecture
• Are there infinitely many Pierpont primes?
• Gilbreath’s conjecture
• Are there infinitely many regular primes, and if so
• Erdős conjecture on arithmetic progressions is their relative density e−1/2 ?

• Erdős–Turán conjecture on additive bases • For any given integer b which is not a perfect power
and not of the form −4k4 for integer k, are there
• Pollock octahedral numbers conjecture infinitely many repunit primes to base b?
• Skolem problem • Are there infinitely many Cullen primes?
• Determine growth rate of rk(N) (see Szemerédi’s • Are there infinitely many Woodall primes?
theorem)
• Are there infinitely many palindromic primes to ev-
• Minimum overlap problem ery base?
2.12 Partial differential equations 7

• Are there infinitely many Fibonacci primes? 2.12 Partial differential equations
• Are there infinitely many Lucas primes? • Regularity of solutions of Vlasov–Maxwell equa-
tions
• Are there infinitely many Pell primes?
• Regularity of solutions of Euler equations
• Are there infinitely many Newman–Shanks–
Williams primes?
2.13 Ramsey theory
• Are all Mersenne numbers of prime index square-
free? • The values of the Ramsey numbers, particularly
R(5, 5)
• Are there infinitely many Wieferich primes?
• The values of the Van der Waerden numbers
• Are there any Wieferich primes in base 47?
• Erdős–Burr conjecture
• Are there any composite c satisfying 2c − 1 ≡ 1 (mod
c2 )?
2.14 Set theory
• For any given integer a > 0, are there infinitely many
primes p such that ap − 1 ≡ 1 (mod p2 )?[66] • The problem of finding the ultimate core model, one
• Can a prime p satisfy 2 p−1 2
≡ 1 (mod p ) and 3 p−1 that contains all large cardinals.
≡ 1 (mod p2 ) simultaneously?[67] • If ℵω is a strong limit cardinal, then 2ℵω < ℵω1
(see Singular cardinals hypothesis). The best bound,
• Are there infinitely many Wilson primes?
ℵω4 , was obtained by Shelah using his pcf theory.
• Are there infinitely many Wolstenholme primes?
• Woodin’s Ω-hypothesis.
• Are there any Wall–Sun–Sun primes? • Does the consistency of the existence of a strongly
2n
• Is every Fermat number 2 + 1 composite for n > 4 compact cardinal imply the consistent existence of a
? supercompact cardinal?

• Are all Fermat numbers square-free? • (Woodin) Does the Generalized Continuum Hy-
pothesis below a strongly compact cardinal im-
• For any given integer a which is not a square and ply the Generalized Continuum Hypothesis every-
does not equal to −1, are there infinitely many where?
primes with a as a primitive root?
• Does there exist a Jónsson algebra on ℵω?
• Artin’s conjecture on primitive roots
• Without assuming the axiom of choice, can a
• Is 78,557 the lowest Sierpiński number (so-called nontrivial elementary embedding V→V exist?
Selfridge’s conjecture)? • Does the Generalized Continuum Hypothesis entail
λ+
• Is 509,203 the lowest Riesel number? ♢(Ecf(λ) ) for every singular cardinal λ ?

• Fortune’s conjecture (that no Fortunate number is • Does the Generalized Continuum Hypothesis imply
composite) the existence of an ℵ2 -Suslin tree?

• Landau’s problems
2.15 Other
• Feit–Thompson conjecture
See also: List of conjectures
• Does every prime number appear in the Euclid–
Mullin sequence?
• List of unsolved problems in statistics
• Does the converse of Wolstenholme’s theorem hold
for all natural numbers? • List of unsolved problems in computer science
• Elliott–Halberstam conjecture • Problems in loop theory and quasigroup theory
• Problems associated to Linnik’s theorem • Problems in Latin squares

• Find the smallest Skewes’ number • Invariant subspace problem

8 3 PROBLEMS SOLVED SINCE 1995

• Kaplansky’s conjectures on groups rings 3 Problems solved since 1995

• Painlevé conjecture
• Boolean Pythagorean triples problem (Marijn
• Dixmier conjecture Heule, Oliver Kullmann, Victor Marek, 2016)[69]

• Baum–Connes conjecture • Babai’s problem (Problem 3.3 in “Spectra of Cayley

graphs”) (A. Abdollahi, M. Zallaghi, 2015)[70]
• Novikov conjecture
• Main conjecture in Vinogradov’s mean-value theo-
• Prove Turing completeness for all unique rem (Jean Bourgain, Ciprian Demeter, Larry Guth,
elementary cellular automaton 2015)[71]

• Generalized star height problem • Erdős discrepancy problem (Terence Tao, 2015)[72]

• Assorted sphere packing problems, e.g. the densest • Umbral moonshine conjecture (John F. R. Duncan,
irregular hypersphere packings Michael J. Griffin, Ken Ono, 2015)[73]

• Anderson conjecture (Cheeger, Naber, 2014)[74]

• Closed curve problem: Find (explicit) necessary and
sufficient conditions that determine when, given two • Gaussian correlation inequality (Thomas Royen,
periodic functions with the same period, the integral 2014)[75]
curve is closed.[68]
• Goldbach’s weak conjecture (Harald Helfgott,
• Keating–Snaith conjecture 2013)[76][77][78]
• Kung–Traub conjecture • Kadison–Singer problem (Adam Marcus, Daniel
Spielman and Nikhil Srivastava, 2013)[79][80] (and
• Atiyah conjecture on configurations the Feichtinger’s conjecture, Anderson’s paving
conjectures, Weaver’s discrepancy theoretic KSr
• Toeplitz' conjecture (open since 1911)
and KSr′ conjectures, Bourgain-Tzafriri conjecture
• Carathéodory conjecture and Rϵ -conjecture)

• Church–Turing thesis • Virtual Haken conjecture (Agol, Groves, Manning,

2012)[81] (and by work of Wise also virtually fibered
• Weight-monodromy conjecture conjecture)

• Berry–Tabor conjecture • Hsiang–Lawson’s conjecture (Brendle, 2012)[82]

• Birkhoff conjecture • Willmore conjecture (Fernando Codá Marques and

André Neves, 2012)[83]
• Guralnick–Thompson conjecture
• Ehrenpreis conjecture (Kahn, Markovic, 2011)[84]
• Hilbert–Smith conjecture
• Hanna Neumann conjecture (Mineyev, 2011)[85]
• MNOP conjecture
• Bloch–Kato conjecture (Voevodsky, 2011)[86] (and
• Mazur’s conjectures Quillen–Lichtenbaum conjecture and by work
of Geisser and Levine (2001) also Beilinson–
• Rendezvous problem Lichtenbaum conjecture[87][88][89] )

• Scholz conjecture • Erdős distinct distances problem (Larry Guth, Netz

Hawk Katz, 2011)[90]
• Nirenberg–Treves conjecture
• Density theorem (Namazi, Souto, 2010)[91]
• Quantum unique ergodicity conjecture
• Hirsch conjecture (Francisco Santos Leal,
• Density hypothesis 2010)[92][93]

• Zhou conjecture • Sidon set problem (J. Cilleruelo, I. Ruzsa and C.

Vinuesa, 2010)[94]
• Borel conjecture
• Atiyah conjecture (Austin, 2009)[95]
• Zeeman conjecture
• Kauffman–Harary conjecture (Matmann, Solis,
• Erdös–Ulam problem 2009)[96]
 9

• Surface subgroup conjecture (Kahn, Markovic, • Poincaré conjecture (Grigori Perelman, 2002)[100]
2009)[97]
• Strong perfect graph conjecture (Maria Chud-
• Scheinerman’s conjecture (Jeremie Chalopin and novsky, Neil Robertson, Paul Seymour and Robin
Daniel Gonçalves, 2009)[98] Thomas, 2002)[125]
• Full classification of finite simple groups (Harada,
Solomon, 2008) • Kouchnirenko’s conjecture (Haas, 2002)[126]

• Geometrization conjecture (proof was completed by • Vaught conjecture (Knight, 2002)[127]

Morgan and Tian in 2008[99] and it is based mostly
on work of Grigori Perelman, 2002)[100] • Double bubble conjecture (Hutchings, Morgan, Ri-
toré, Ros, 2002)[128]
• Serre’s modularity conjecture (Chandrashekhar
Khare and Jean-Pierre Wintenberger,
• Catalan’s conjecture (Preda Mihăilescu, 2002)[129]
2008)[101][102][103]

• Heterogeneous tiling conjecture (squaring the plane) • n! conjecture (Haiman, 2001)[130] (and also
(Frederick V. Henle and James M. Henle, 2008)[104] Macdonald positivity conjecture)

• Erdős–Menger conjecture (Aharoni, Berger • Kato’s conjecture (Auscher, Hofmann, Lacey,

2007)[105] McIntosh and Tchamitchian, 2001)[131]
• Road coloring conjecture (Avraham Trahtman,
2007)[106] • Deligne’s conjecture on 1-motives (Luca Barbieri-
Viale, Andreas Rosenschon, Morihiko Saito,
• The angel problem (Various independent proofs, 2001)[132]
2006)[107][108][109][110]
• Modularity theorem (Breuil, Conrad, Diamond and
• Lax conjecture (Lewis, Parrilo, Ramana, 2005)[111] Taylor, 2001)[133]
• The Langlands–Shelstad fundamental lemma (Ngô
Bảo Châu and Gérard Laumon, 2004)[112] • Erdős–Stewart conjecture (Florian Luca, 2001)[134]

• Tameness conjecture and Ahlfors measure conjec- • Berry–Robbins problem (Atiyah, 2000)[135]
ture (Ian Agol, 2004)[113]
• Erdős–Graham problem (Croot, 2000)[136]
• Robertson–Seymour theorem (Robertson, Sey-
mour, 2004)[114]
• Honeycomb conjecture (Thomas Hales, 1999)[137]
• Stanley–Wilf conjecture (Gábor Tardos and Adam
Marcus, 2004)[115] (and also Alon–Friedgut conjec- • Gradient conjecture (Krzysztof Kurdyka, Tadeusz
ture) Mostowski, Adam Parusinski, 1999)[138]

• Green–Tao theorem (Ben J. Green and Terence Tao, • Bogomolov conjecture (Emmanuel Ullmo, 1998,
2004)[116] Shou-Wu Zhang, 1998)[139][140]
• Ending lamination theorem (Jeffrey F. Brock,
Richard D. Canary, Yair N. Minsky, 2004)[117] • Lafforgue’s theorem (Laurent Lafforgue, 1998)[141]

• Carpenter’s rule problem (Connelly, Demaine, • Kepler conjecture (Ferguson, Hales, 1998)[142]
Rote, 2003)[118]
• Dodecahedral conjecture (Hales, McLaughlin,
• Cameron–Erdős conjecture (Ben J. Green, 2003,
1998)[143]
Alexander Sapozhenko, 2003)[119][120]

• Milnor conjecture (Vladimir Voevodsky, 2003)[121] • Ganea conjecture (Iwase, 1997)[144]

• Kemnitz’s conjecture (Reiher, 2003, di Fiore, • Torsion conjecture (Merel, 1996)[145]

2003)[122]

• Nagata’s conjecture (Shestakov, Umirbaev, • Harary’s conjecture (Chen, 1996)[146]

2003)[123]
• Fermat’s Last Theorem (Andrew Wiles and Richard
• Kirillov’s conjecture (Baruch, 2003)[124] Taylor, 1995)[147][148]
10 4 REFERENCES

4 References [17] Matschke, Benjamin (2014), “A survey on the square peg

problem”, Notices of the American Mathematical Society,
[1] Eves, An Introduction to the History of Mathematics 6th 61 (4): 346–253, doi:10.1090/noti1100
Edition, Thomson, 1990, ISBN 978-0-03-029558-4. [18] Norwood, Rick; Poole, George; Laidacker, Michael
(1992), “The worm problem of Leo Moser”, Discrete
[2] Thiele, Rüdiger (2005), “On Hilbert and his twenty-four
and Computational Geometry, 7 (2): 153–162,
problems”, in Van Brummelen, Glen, Mathematics and
doi:10.1007/BF02187832, MR 1139077
the historian’s craft. The Kenneth O. May Lectures, CMS
Books in Mathematics/Ouvrages de Mathématiques de la [19] Wagner, Neal R. (1976), “The Sofa Problem” (PDF),
SMC, 21, pp. 243–295, ISBN 0-387-25284-3 The American Mathematical Monthly, 83 (3): 188–189,
doi:10.2307/2977022, JSTOR 2977022
[3] Guy, Richard (1994), Unsolved Problems in Number The-
ory (2nd ed.), Springer, p. vii, ISBN 9781489935854. [20] Demaine, Erik D.; O'Rourke, Joseph (2007), “Chapter
22. Edge Unfolding of Polyhedra”, Geometric Folding Al-
[4] Shimura, G. (1989). “Yutaka Taniyama and his time”. gorithms: Linkages, Origami, Polyhedra, Cambridge Uni-
Bulletin of the London Mathematical Society. 21 (2): 186– versity Press, pp. 306–338
196. doi:10.1112/blms/21.2.186.
[21] Bellos, Alex (11 August 2015), “Attack on the pen-
[5] http://www.uni-regensburg.de/Fakultaeten/nat_Fak_I/ tagon results in discovery of new mathematical tile”, The
friedl/papers/dmv_091514.pdf Guardian
[6] THREE DIMENSIONAL MANIFOLDS, KLEINIAN [22] ACW (May 24, 2012), “Convex uniform 5-polytopes”,
GROUPS AND HYPERBOLIC GEOMETRY Open Problem Garden, retrieved 2016-10-04.

[7] Abe, Jair Minoro; Tanaka, Shotaro (2001). Unsolved [23] Kari, Jarkko (2009), “Structure of reversible cellular au-
Problems on Mathematics for the 21st Century. IOS Press. tomata”, Unconventional Computation: 8th International
ISBN 9051994907. Conference, UC 2009, Ponta Delgada, Portugal, Septem-
ber 7ÔÇô11, 2009, Proceedings, Lecture Notes in Com-
[8] “DARPA invests in math”. CNN. 2008-10-14. Archived puter Science, 5715, Springer, p. 6, doi:10.1007/978-3-
from the original on 2009-03-04. Retrieved 2013-01-14. 642-03745-0_5
[9] “Broad Agency Announcement (BAA 07-68) for Defense [24] Florek, Jan (2010), “On Barnette’s conjecture”,
Sciences Office (DSO)". DARPA. 2007-09-10. Archived Discrete Mathematics, 310 (10–11): 1531–1535,
from the original on 2012-10-01. Retrieved 2013-06-25. doi:10.1016/j.disc.2010.01.018, MR 2601261.

[10] “Millennium Problems”. [25] Broersma, Hajo; Patel, Viresh; Pyatkin, Artem (2014),
“On toughness and Hamiltonicity of $2K_2$-free
[11] “Poincaré Conjecture”. Clay Mathematics Institute. graphs”, Journal of Graph Theory, 75 (3): 244–255,
Archived from the original on 2013-12-15. doi:10.1002/jgt.21734, MR 3153119
[12] “Smooth 4-dimensional Poincare conjecture”. [26] Jaeger, F. (1985), “A survey of the cycle double cover con-
jecture”, Annals of Discrete Mathematics 27 – Cycles in
[13] For background on the numbers that are the focus of this Graphs, North-Holland Mathematics Studies, 27, pp. 1–
problem, see articles by Eric W. Weisstein, on pi (), e (), 12, doi:10.1016/S0304-0208(08)72993-1.
Khinchin’s Constant (), irrational numbers (), transcen-
dental numbers (), and irrationality measures () at Wol- [27] Heckman, Christopher Carl; Krakovski, Roi (2013),
fram MathWorld, all articles accessed 15 December 2014. “Erdös-Gyárfás conjecture for cubic planar graphs”, Elec-
tronic Journal of Combinatorics, 20 (2), P7.
[14] Michel Waldschmidt, 2008, “An introduction to irra-
tionality and transcendence methods,” at The University [28] Akiyama, Jin; Exoo, Geoffrey; Harary, Frank (1981),
of Arizona The Southwest Center for Arithmetic Geom- “Covering and packing in graphs. IV. Linear arboricity”,
etry 2008 Arizona Winter School, March 15–19, 2008 Networks, 11 (1): 69–72, doi:10.1002/net.3230110108,
(Special Functions and Transcendence), see , accessed 15 MR 608921.
December 2014.
[29] L. Babai, Automorphism groups, isomorphism, recon-
[15] John Albert, posting date unknown, “Some unsolved struction, in Handbook of Combinatorics, Vol. 2, Elsevier,
problems in number theory” [from Victor Klee & Stan 1996, 1447–1540.
Wagon, “Old and New Unsolved Problems in Plane Ge-
ometry and Number Theory"], in University of Oklahoma [30] Chung, Fan; Graham, Ron (1998), Erdős on Graphs: His
Math 4513 course materials, see , accessed 15 December Legacy of Unsolved Problems, A K Peters, pp. 97–99.
2014. [31] Toft, Bjarne (1996), “A survey of Hadwiger’s conjecture”,
Congressus Numerantium, 115: 249–283, MR 1411244.
[16] Socolar, Joshua E. S.; Taylor, Joan M. (2012), “Forc-
ing nonperiodicity with a single tile”, The Mathemat- [32] Croft, Hallard T.; Falconer, Kenneth J.; Guy, Richard K.
ical Intelligencer, 34 (1): 18–28, arXiv:1009.1419 , (1991), Unsolved Problems in Geometry, Springer-Verlag,
doi:10.1007/s00283-011-9255-y, MR 2902144 Problem G10.
 11

[33] Sauer, N. (2001), “Hedetniemi’s conjecture: a sur- [48] “Jorgensen’s Conjecture”, Open Problem Garden, re-
vey”, Discrete Mathematics, 229 (1–3): 261–292, trieved 2016-11-13.
doi:10.1016/S0012-365X(00)00213-2, MR 1815610.
[49] Kühn, Daniela; Mycroft, Richard; Osthus, Deryk (2011),
[34] Hägglund, Jonas; Steffen, Eckhard (2014), “Petersen- “A proof of Sumner’s universal tournament conjec-
colorings and some families of snarks”, Ars Mathematica ture for large tournaments”, Proceedings of the Lon-
Contemporanea, 7 (1): 161–173, MR 3047618. don Mathematical Society, Third Series, 102 (4): 731–
[35] Jensen, Tommy R.; Toft, Bjarne (1995), “12.20 List- 766, arXiv:1010.4430 , doi:10.1112/plms/pdq035, MR
Edge-Chromatic Numbers”, Graph Coloring Problems, 2793448, Zbl 1218.05034.
New York: Wiley-Interscience, pp. 201–202, ISBN 0-
[50] Brešar, Boštjan; Dorbec, Paul; Goddard, Wayne; Hart-
471-02865-7.
nell, Bert L.; Henning, Michael A.; Klavžar, Sandi; Rall,
[36] Huang, C.; Kotzig, A.; Rosa, A. (1982), “Further results Douglas F. (2012), “Vizing’s conjecture: a survey and re-
on tree labellings”, Utilitas Mathematica, 21: 31–48, MR cent results”, Journal of Graph Theory, 69 (1): 46–76,
668845. doi:10.1002/jgt.20565, MR 2864622.

[37] Molloy, Michael; Reed, Bruce (1998), “A bound on the [51] Shelah S, Classification Theory, North-Holland, 1990
total chromatic number”, Combinatorica, 18 (2): 241–
280, doi:10.1007/PL00009820, MR 1656544. [52] Keisler, HJ, “Ultraproducts which are not saturated.” J.
Symb Logic 32 (1967) 23—46.
[38] Barát, János; Tóth, Géza (2010), “Towards the Albertson
Conjecture”, Electronic Journal of Combinatorics, 17 (1): [53] Malliaris M, Shelah S, “A dividing line in simple unstable
R73, arXiv:0909.0413 . theories.” http://arxiv.org/abs/1208.2140

[39] Wood, David (January 19, 2009), “Book Thickness of [54] Gurevich, Yuri, “Monadic Second-Order Theories,” in J.
Subdivisions”, Open Problem Garden, retrieved 2013-02- Barwise, S. Feferman, eds., Model-Theoretic Logics (New
05. York: Springer-Verlag, 1985), 479–506.

[40] Fulek, R.; Pach, J. (2011), “A computational approach [55] Peretz, Assaf, “Geometry of forking in simple theories.”
to Conway’s thrackle conjecture”, Computational Geom- J. Symbolic Logic Volume 71, Issue 1 (2006), 347–359.
etry, 44 (6–7): 345–355, doi:10.1007/978-3-642-18469-
7_21, MR 2785903. [56] Shelah, Saharon (1999). “Borel sets with large
squares”. Fundamenta Mathematicae. 159 (1): 1–50.
[41] Hartsfield, Nora; Ringel, Gerhard (2013), Pearls in Graph
arXiv:math/9802134 .
Theory: A Comprehensive Introduction, Dover Books on
Mathematics, Courier Dover Publications, p. 247, ISBN [57] Shelah, Saharon (2009). Classification theory for abstract
9780486315522, MR 2047103. elementary classes. College Publications. ISBN 978-1-
[42] Hliněný, Petr (2010), “20 years of Negami’s planar 904987-71-0.
cover conjecture” (PDF), Graphs and Combinatorics,
[58] Makowsky J, “Compactness, embeddings and definabil-
26 (4): 525–536, doi:10.1007/s00373-010-0934-9, MR
ity,” in Model-Theoretic Logics, eds Barwise and Fefer-
2669457.
man, Springer 1985 pps. 645–715.
[43] Nöllenburg, Martin; Prutkin, Roman; Rutter, Ignaz
(2016), “On self-approaching and increasing-chord draw- [59] Baldwin, John T. (July 24, 2009). Categoricity
ings of 3-connected planar graphs”, Journal of Computa- (PDF). American Mathematical Society. ISBN 978-
tional Geometry, 7 (1): 47–69, doi:10.20382/jocg.v7i1a3, 0821848937. Retrieved February 20, 2014.
MR 3463906
[60] Shelah, Saharon. “Introduction to classification theory for
[44] Pach, János; Sharir, Micha (2009), “5.1 Crossings—the abstract elementary classes”.
Brick Factory Problem”, Combinatorial Geometry and Its
Algorithmic Applications: The Alcalá Lectures, Mathemat- [61] Hrushovski, Ehud (1989). “Kueker’s conjecture for stable
ical Surveys and Monographs, 152, American Mathemat- theories”. Journal of Symbolic Logic. 54 (1): 207–220.
ical Society, pp. 126–127. doi:10.2307/2275025.

[45] Demaine, E.; O'Rourke, J. (2002–2012), “Problem 45: [62] Cherlin, G.; Shelah, S. (May 2007). “Universal graphs
Smallest Universal Set of Points for Planar Graphs”, The with a forbidden subtree”. Journal of Combinatorial The-
Open Problems Project, retrieved 2013-03-19. ory, Series B. 97 (3): 293–333. arXiv:math/0512218 .
doi:10.1016/j.jctb.2006.05.008.
[46] Chudnovsky, Maria (2014), “The Erdös–Hajnal
conjecture—a survey” (PDF), Journal of Graph [63] Džamonja, Mirna, “Club guessing and the universal mod-
Theory, 75 (2): 178–190, arXiv:1606.08827 , els.” On PCF, ed. M. Foreman, (Banff, Alberta, 2004).
doi:10.1002/jgt.21730, MR 3150572, Zbl 1280.05086.
[64] “Are the Digits of Pi Random? Berkeley Lab Researcher
[47] Spinrad, Jeremy P. (2003), “2. Implicit graph represen- May Hold Key”.
tation”, Efficient Graph Representations, pp. 17–30, ISBN
0-8218-2815-0. [65] http://arxiv.org/pdf/1604.07746v1.pdf
12 4 REFERENCES

[66] Ribenboim, P. (2006). Die Welt der Primzahlen [84] http://arxiv.org/pdf/1101.1330v4.pdf

(in German) (2nd ed.). Springer. pp. 242–
243. doi:10.1007/978-3-642-18079-8. ISBN 978-3-642- [85] http://www.math.uiuc.edu/~{}mineyev/math/art/
18078-1. submult-shnc.pdf

[67] Dobson, J. B. (June 2012) [2011], On Lerch’s formula for [86] http://annals.math.princeton.edu/wp-content/uploads/
annals-v174-n1-p11-p.pdf
the Fermat quotient, p. 15, arXiv:1103.3907
[87] https://www.uni-due.de/~{}bm0032/publ/BlochKato.
[68] Barros, Manuel (1997), “General Helices and a Theorem pdf
of Lancret”, American Mathematical Society, 125: 1503–
1509, JSTOR 2162098 [88] page 359

[69] http://arxiv.org/pdf/1605.00723v1.pdf [89] “motivic cohomology – Milnor–Bloch–Kato conjecture

implies the Beilinson-Lichtenbaum conjecture – Math-
[70] Abdollahi A., Zallaghi M. (2015). “Character sums for Overflow”.
Cayley graphs”. Communications in Algebra. 43 (12):
5159–5167. doi:10.1080/00927872.2014.967398. [90] http://arxiv.org/pdf/1011.4105v3.pdf

[71] Bourgain, Jean; Ciprian, Demeter; Larry, Guth (2015). [91] https://www.researchgate.net/profile/Juan_Souto3/
“Proof of the main conjecture in Vinogradov’s Mean publication/228365532_Non-realizability_and_ending_
Value Theorem for degrees higher than three”. Annals laminations_Proof_of_the_Density_Conjecture/links/
of Mathematics. 541d85a10cf2218008d1d2e5.pdf

[72] http://arxiv.org/pdf/1509.05363v5.pdf [92] Santos, Franciscos (2012). “A counterexample to the

Hirsch conjecture”. Annals of Mathematics. Princeton
[73] Proof of the umbral moonshine conjecture – Springer University and Institute for Advanced Study. 176 (1):
383–412. doi:10.4007/annals.2012.176.1.7.
[74] http://arxiv.org/pdf/1406.6534v10.pdf
[93] Ziegler, Günter M. (2012). “Who solved the Hirsch con-
[75] “A Long-Sought Proof, Found and Almost Lost”. Quanta jecture?". Documenta Mathematica. Extra Volume “Op-
Magazine. Natalie Wolchover. March 28, 2017. Re- timization Stories": 75–85.
trieved May 2, 2017.
[94] “Generalized Sidon sets”. Advances in Mathematics. 225:
[76] Helfgott, Harald A. (2013). “Major arcs for Goldbach’s 2786–2807. doi:10.1016/j.aim.2010.05.010.
theorem”. arXiv:1305.2897 [math.NT].
[95] http://arxiv.org/pdf/0909.2360v3.pdf
[77] Helfgott, Harald A. (2012). “Minor arcs for Goldbach’s
[96] http://arxiv.org/pdf/0906.1612v2.pdf
problem”. arXiv:1205.5252 [math.NT].
[97] http://arxiv.org/pdf/0910.5501v5.pdf
[78] Helfgott, Harald A. (2013). “The ternary Goldbach con-
jecture is true”. arXiv:1312.7748 [math.NT]. [98] http://www.csie.ntu.edu.tw/~{}hil/bib/ChalopinG09.pdf

[79] Casazza, Peter G.; Fickus, Matthew; Tremain, Janet C.; [99] http://arxiv.org/pdf/0809.4040.pdf
Weber, Eric (2006). Han, Deguang; Jorgensen, Palle E.
[100] “Prize for Resolution of the Poincaré Conjecture
T.; Larson, David Royal, eds. “The Kadison-Singer prob-
Awarded to Dr. Grigoriy Perelman” (PDF) (Press re-
lem in mathematics and engineering: A detailed account”.
lease). Clay Mathematics Institute. March 18, 2010. Re-
Contemporary Mathematics. Large Deviations for Addi-
trieved November 13, 2015. The Clay Mathematics Insti-
tive Functionals of Markov Chains: The 25th Great Plains
tute hereby awards the Millennium Prize for resolution of
Operator Theory Symposium, June 7–12, 2005, Univer-
the Poincaré conjecture to Grigoriy Perelman.
sity of Central Florida, Florida. American Mathematical
Society. 414: 299–355. doi:10.1090/conm/414/07820. [101] Khare, Chandrashekhar; Wintenberger, Jean-Pierre
ISBN 978-0-8218-3923-2. Retrieved 24 April 2015. (2009), “Serre’s modularity conjecture (I)", Inventiones
Mathematicae, 178 (3): 485–504, doi:10.1007/s00222-
[80] Mackenzie, Dana. “Kadison–Singer Problem Solved” 009-0205-7
(PDF). SIAM News (January/February 2014). Society for
Industrial and Applied Mathematics. Retrieved 24 April [102] Khare, Chandrashekhar; Wintenberger, Jean-Pierre
2015. (2009), “Serre’s modularity conjecture (II)", Inventiones
Mathematicae, 178 (3): 505–586, doi:10.1007/s00222-
[81] http://arxiv.org/pdf/1204.2810v1.pdf 009-0206-6
[82] http://www.math.jhu.edu/~{}js/Math646/brendle. [103] “2011 Cole Prize in Number Theory” (PDF). Notices of
lawson.pdf the AMS. Providence, Rhode Island, United States: Amer-
ican Mathematical Society. 58 (4): 610–611. ISSN
[83] Marques, Fernando C.; Neves, André (2013). “Min-
1088-9477. OCLC 34550461.
max theory and the Willmore conjecture”. Annals of
Mathematics. 179: 683–782. arXiv:1202.6036 . [104] http://www.ww.amc12.org/sites/default/files/pdf/pubs/
doi:10.4007/annals.2014.179.2.6. SquaringThePlane.pdf
 13

[105] http://arxiv.org/pdf/math/0509397.pdf [122] “Kemnitz’ conjecture revisited”. Discrete Mathematics.

297: 196–201. doi:10.1016/j.disc.2005.02.018.
[106] Seigel-Itzkovich, Judy (2008-02-08). “Russian immigrant
solves math puzzle”. The Jerusalem Post. Retrieved [123] http://www.ams.org/journals/jams/2004-17-01/
2015-11-12. S0894-0347-03-00440-5/S0894-0347-03-00440-5.pdf
[107] http://homepages.warwick.ac.uk/~{}masgak/papers/ [124] http://annals.math.princeton.edu/wp-content/uploads/
bhb-angel.pdf annals-v158-n1-p04.pdf
[108] http://home.broadpark.no/~{}oddvark/angel/Angel.pdf [125] “The strong perfect graph theorem”.
[109] http://homepages.warwick.ac.uk/~{}masibe/ [126] http://www.emis.de/journals/BAG/vol.43/no.1/
angel-mathe.pdf b43h1haa.pdf
[110] http://www.cs.bu.edu/~{}gacs/papers/angel.pdf [127] Knight, R. W. (2002), The Vaught Conjecture: A Coun-
[111] http://www.ams.org/journals/proc/2005-133-09/ terexample, manuscript
S0002-9939-05-07752-X/S0002-9939-05-07752-X. [128] http://www.ugr.es/~{}ritore/preprints/0406017.pdf
pdf
[129] Metsänkylä, Tauno (5 September 2003). “Catalan’s
[112] “Fields Medal – Ngô Bảo Châu”. International Congress conjecture: another old diophantine problem solved”
of Mathematicians 2010. ICM. 19 August 2010. Re- (PDF). Bulletin of the American Mathematical Soci-
trieved 2015-11-12. Ngô Bảo Châu is being awarded ety. American Mathematical Society. 41 (1): 43–57.
the 2010 Fields Medal for his proof of the Fundamental doi:10.1090/s0273-0979-03-00993-5. ISSN 0273-0979.
Lemma in the theory of automorphic forms through the The conjecture, which dates back to 1844, was recently
introduction of new algebro-geometric methods. proven by the Swiss mathematician Preda Mihăilescu.
[113] http://arxiv.org/pdf/math/0405568v1.pdf
[130] http://www.ams.org/journals/jams/2001-14-04/
[114] “Graph Theory”. S0894-0347-01-00373-3/S0894-0347-01-00373-3.pdf

[115] Chung, Fan; Greene, Curtis; Hutchinson, Joan (April [131] http://junon.u-3mrs.fr/monniaux/AHLMT02.pdf
2015). “Herbert S. Wilf (1931–2012)" (PDF). Notices of
[132] http://arxiv.org/pdf/math/0102150v4.pdf
the AMS. Providence, Rhode Island, United States: Amer-
ican Mathematical Society. 62 (4): 358. ISSN 1088- [133] Breuil, Christophe; Conrad, Brian; Diamond, Fred;
9477. OCLC 34550461. The conjecture was finally given Taylor, Richard (2001), “On the modularity of ellip-
an exceptionally elegant proof by A. Marcus and G. Tar- tic curves over Q: wild 3-adic exercises”, Journal of
dos in 2004. the American Mathematical Society, 14 (4): 843–939,
doi:10.1090/S0894-0347-01-00370-8, ISSN 0894-0347,
[116] “Bombieri and Tao Receive King Faisal Prize” (PDF).
MR 1839918
Notices of the AMS. Providence, Rhode Island, United
States: American Mathematical Society. 57 (5): 642– [134] http://www.ams.org/journals/mcom/2001-70-234/
643. May 2010. ISSN 1088-9477. OCLC 34550461. S0025-5718-00-01178-9/S0025-5718-00-01178-9.pdf
Working with Ben Green, he proved there are arbitrarily
long arithmetic progressions of prime numbers—a result [135] http://intlpress.com/site/pub/files/_fulltext/journals/sdg/
now known as the Green–Tao theorem. 2002/0007/0001/SDG-2002-0007-0001-a001.pdf

[117] http://arxiv.org/pdf/math/0412006v2.pdf [136] Croot, Ernest S., III (2000), Unit Fractions, Ph.D. the-
sis, University of Georgia, Athens. Croot, Ernest S., III
[118] Connelly, Robert; Demaine, Erik D.; Rote, Günter
(2003), “On a coloring conjecture about unit fractions”,
(2003), “Straightening polygonal arcs and convexifying
Annals of Mathematics, 157 (2): 545–556, arXiv:math.
polygonal cycles” (PDF), Discrete and Computational Ge-
ometry, 30 (2): 205–239, doi:10.1007/s00454-003-0006- NT/0311421 , doi:10.4007/annals.2003.157.545
7, MR 1931840 [137] http://arxiv.org/pdf/math/9906042v2.pdf
[119] Green, Ben (2004), “The Cameron–Erdős conjec- [138] http://arxiv.org/pdf/math/9906212v2.pdf
ture”, The Bulletin of the London Mathematical So-
ciety, 36 (6): 769–778, arXiv:math.NT/0304058 , [139] Ullmo, E (1998). “Positivité et Discrétion des Points Al-
doi:10.1112/S0024609304003650, MR 2083752 gébriques des Courbes”. Annals of Mathematics. 147 (1):
167–179. doi:10.2307/120987. Zbl 0934.14013.
[120] “News from 2007”. American Mathematical Society.
AMS. 31 December 2007. Retrieved 2015-11-13. The [140] Zhang, S.-W. (1998). “Equidistribution of small points
2007 prize also recognizes Green for “his many outstand- on abelian varieties”. Annals of Mathematics. 147 (1):
ing results including his resolution of the Cameron-Erdős 159–165. doi:10.2307/120986.
conjecture...”
[141] Lafforgue, Laurent (1998), “Chtoucas de Drinfeld et ap-
[121] http://archive.numdam.org/ARCHIVE/PMIHES/ plications” [Drinfelʹd shtukas and applications], Docu-
PMIHES_2003__98_/PMIHES_2003__98__1_0/ menta Mathematica (in French), II: 563–570, ISSN 1431-
PMIHES_2003__98__1_0.pdf 0635, MR 1648105
 14 6 EXTERNAL LINKS

[142] http://arxiv.org/pdf/1501.02155.pdf • Klee, Victor; Wagon, Stan (1996). Old and New
Unsolved Problems in Plane Geometry and Number
[143] http://arxiv.org/pdf/math/9811079v3.pdf Theory. The Mathematical Association of America.
ISBN 0-88385-315-9.
[144] Norio Iwase (1 November 1998). “Ganea’s Conjecture on
Lusternik-Schnirelmann Category”. ResearchGate. • Du Sautoy, Marcus (2003). The Music of the Primes:
Searching to Solve the Greatest Mystery in Mathemat-
[145] Merel, Loïc (1996). “Bornes pour la torsion des courbes
ics. Harper Collins. ISBN 0-06-093558-8.
elliptiques sur les corps de nombres” [Bounds for the tor-
sion of elliptic curves over number fields]. Inventiones • Derbyshire, John (2003). Prime Obsession: Bern-
Mathematicae (in French) 124 (1): 437–449. doi:10.
hard Riemann and the Greatest Unsolved Problem
1007/s002220050059. MR 1369424
in Mathematics. Joseph Henry Press. ISBN 0-309-
[146] https://www.researchgate.net/profile/Zhibo_Chen/ 08549-7.
publication/220188021_Harary’{}s_conjectures_on_
integral_sum_graphs/links/5422b2490cf290c9e3aac7fe.
• Devlin, Keith (2006). The Millennium Problems –
pdf The Seven Greatest Unsolved* Mathematical Puzzles
Of Our Time. Barnes & Noble. ISBN 978-0-7607-
[147] Wiles, Andrew (1995). “Modular elliptic curves and 8659-8.
Fermat’s Last Theorem” (PDF). Annals of Mathe-
matics. Annals of Mathematics. 141 (3): 443– • Blondel, Vincent D.; Megrestski, Alexandre (2004).
551. doi:10.2307/2118559. JSTOR 2118559. OCLC Unsolved problems in mathematical systems and con-
37032255. trol theory. Princeton University Press. ISBN 0-
691-11748-9.
[148] Taylor R, Wiles A (1995). “Ring theoretic proper-
ties of certain Hecke algebras”. Annals of Mathe- • Lizhen Ji, [various]; Yat-Sun Poon, Shing-Tung Yau
matics. Annals of Mathematics. 141 (3): 553– (2013). Open Problems and Surveys of Contempo-
572. doi:10.2307/2118560. JSTOR 2118560. OCLC rary Mathematics (volume 6 in the Surveys in Modern
37032255. Mathematics series) (Surveys of Modern Mathemat-
ics). International Press of Boston. ISBN 1-571-
46278-3.
5 Further reading • Waldschmidt, Michel (2004). “Open Diophantine
Problems” (PDF). Moscow Mathematical Journal. 4
5.1 Books discussing recently solved prob- (1): 245–305. ISSN 1609-3321. Zbl 1066.11030.
lems
• Mazurov, V. D.; Khukhro, E. I. (1 Jun 2015).
“Unsolved Problems in Group Theory. The
• Singh, Simon (2002). Fermat’s Last Theorem.
Kourovka Notebook. No. 18 (English version)".
Fourth Estate. ISBN 1-84115-791-0.
arXiv:1401.0300v6 .
• O'Shea, Donal (2007). The Poincaré Conjecture.
• Derbyshire, John (2003). Prime Obsession. The
Penguin. ISBN 978-1-84614-012-9.
Joseph Henry Press. ISBN 0-309-08549-7.
• Szpiro, George G. (2003). Kepler’s Conjecture. Wi-
ley. ISBN 0-471-08601-0.
6 External links
• Ronan, Mark (2006). Symmetry and the Monster.
Oxford. ISBN 0-19-280722-6. • 24 Unsolved Problems and Rewards for them

• List of links to unsolved problems in mathematics,

5.2 Books discussing unsolved problems prizes and research

• Fan Chung; Graham, Ron (1999). Erdos on Graphs: • Open Problem Garden The collection of open prob-
His Legacy of Unsolved Problems. AK Peters. ISBN lems in mathematics build on the principle of user
1-56881-111-X. editable (“wiki”) site

• AIM Problem Lists

• Croft, Hallard T.; Falconer, Kenneth J.; Guy,
Richard K. (1994). Unsolved Problems in Geome- • Unsolved Problem of the Week Archive. MathPro
try. Springer. ISBN 0-387-97506-3. Press.

• Guy, Richard K. (2004). Unsolved Problems in • Ball, John M. “Some Open Problems in Elasticity”
Number Theory. Springer. ISBN 0-387-20860-7. (PDF).
 15

• Constantin, Peter. “Some open problems and re-

search directions in the mathematical study of fluid
dynamics” (PDF).

• Serre, Denis. “Five Open Problems in Compressible

Mathematical Fluid Dynamics” (PDF).

• Unsolved Problems in Number Theory, Logic and

Cryptography

• 200 open problems in graph theory

• The Open Problems Project (TOPP), discrete and
computational geometry problems
• Kirby’s list of unsolved problems in low-dimensional
topology

• Erdös’ Problems on Graphs

• A List of Approachable Open Problems in Knot
Theory
• Unsolved Problems in Virtual Knot Theory and
Combinatorial Knot Theory
• Open problems from the 12th International Confer-
ence on Fuzzy Set Theory and Its Applications
• List of open problems in inner model theory

• Aizenman, Michael. “Open Problems in Mathemat-

ical Physics”.

• 15 Problems in Mathematical Physics

16 7 TEXT AND IMAGE SOURCES, CONTRIBUTORS, AND LICENSES

7 Text and image sources, contributors, and licenses

7.1 Text
• List of unsolved problems in mathematics Source: https://en.wikipedia.org/wiki/List_of_unsolved_problems_in_mathematics?oldid=
780301781 Contributors: AxelBoldt, Zundark, The Anome, XJaM, Imran, Olivier, Ken Arromdee, Michael Hardy, Dominus, Gabbe,
Ixfd64, TakuyaMurata, Karada, Plaudite~enwiki, Bogdangiusca, Schneelocke, Charles Matthews, Timwi, Reddi, Gutza, Sabbut, Shizhao,
Prisonblues, ThereIsNoSteve, Jni, Donarreiskoffer, Altenmann, Bkell, JackofOz, Robinh, Giftlite, Gene Ward Smith, Mellum, Frencheigh,
Jason Quinn, Farside~enwiki, CryptoDerk, Gdr, DragonflySixtyseven, Icairns, Andreas Kaufmann, PhotoBox, Rich Farmbrough, Qutezuce,
ArnoldReinhold, DcoetzeeBot~enwiki, Bender235, ESkog, Jnestorius, Porton, Billymac00, OBryant, Haham hanuka, Andrew Gray,
Japanese Searobin, Hjb, Joriki, OwenX, Shreevatsa, Havermayer, Btyner, Reddwarf2956, Reisio, Rjwilmsi, Staecker, TheRingess, Salix
alba, Ems57fcva, Bubba73, Maxal, Jrtayloriv, Glenn L, Salvatore Ingala, Chobot, Bgwhite, Algebraist, YurikBot, Wavelength, Hillman,
Chuck Carroll, Pi Delport, Dkostic, Rick Norwood, Aftermath, Rhythm, Behemoth01, Pegship, Noosfractal, StuRat, Arthur Rubin, Acer,
Tom Duff, Jeff Silvers, That Guy, From That Show!, SmackBot, Sergiolerner, David Kernow, Pokipsy76, GraemeMcRae, Gilliam, Drttm,
Persian Poet Gal, Mordac, PrimeHunter, MalafayaBot, Wikipediatrix, Scwlong, Love4Mizzou, Jmnbatista, M2K 2, AndreRD, G716,
Lambiam, IronGargoyle, Syrcatbot, Michael Kinyon, JeffW, Abel Cavaşi, Antonio Prates, Hottiger, CRGreathouse, CmdrObot, CME46,
Myasuda, Gregbard, Doctormatt, Ntsimp, Cyhawk, Gogo Dodo, Asenine, Tewapack, Paxinum, Ij00mini, Damelch, Hermel, Ghmyrtle,
Dhrm77, Turgidson, The Transhumanist, Yill577, Magioladitis, VoABot II, JamesBWatson, Xkcd, Rivertorch, Email4mobile, Homunq,
KConWiki, Etale, Subatomicguy, Minimiscience, David Eppstein, Kope, Jonathan Stokes, Drewmutt, Obscurans, Xharze, Manticore, We-
burbia, Ratfox, Boaex, Oshwah, A4bot, Bah23, Cae prince, Caltas, Flyer22 Reborn, Cyfal, Crazz bug 5, ClueBot, DFRussia, Justin W
Smith, Unbuttered Parsnip, Make91, Blanchardb, DragonBot, Worth my salt, Tnxman307, Zyamada, Myrocarcassonne, Richard-of-Earth,
Dekart, Airplaneman, Addbot, Some jerk on the Internet, Fluffernutter, Apovolot, Breggen, SpBot, EdPeggJr, Lightbot, Ettrig, Yobot,
Gunnar Hendrich, AnomieBOT, XL2D, DemocraticLuntz, Ciphers, Jsbmitchell, Jim1138, Materialscientist, Citation bot, Kinewma, De-
voutb3nji, Ptrf, Omnipaedista, VladimirReshetnikov, Kylelovesyou, VictorPorton, Thehelpfulbot, Dan6hell66, Claumuniak, FrescoBot, HJ
Mitchell, DivineAlpha, Shuroo, Swordsmankirby, Pinethicket, 10metreh, Jonesey95, Victor Alexandrov, Full-date unlinking bot, Dslarryf,
Yunshui, Ruslan Sharipov, Earthandmoon, Xnn, Piotrek54321, Rayman60, Takahiro4, Orphan Wiki, LucasBrown, Pro translator, Jsi-
tarz, CentraCross, Suslindisambiguator, D.Lazard, Wikitürkçe, Wiggles007, Toshio Yamaguchi, L Kensington, Chewings72, C0617470r,
ClueBot NG, Lllrahman, Joel B. Lewis, MerlIwBot, Helpful Pixie Bot, Syxiao, Spitemaster, Julmonn, Lowercase sigmabot, Ymblanter,
Solomon7968, Racoon86, Huntingg, Cliff12345, Phoenixia1177, SoylentPurple, BattyBot, JYBot, Deltahedron, Saung Tadashi, XXN,
AHusain314, Randykitty, Csinva, Red-eyed demon, Michi5738, ElHef, Arksenu, Comp.arch, Jupitus Smart, Zhang Tianshu, MrLink-
inPark333, Eigenbra, UY Scuti, Tomaphone, ProKro, K9re11, NewsTeamAssemble, Jeremyb-phone, Skolem42, Antideregister, 22mer-
lin, Nauriya, CatcherStorm, Monkbot, Veritas31415, Horseless Headman, Atal 26, Tcc astronaut, Doublefelix921, Mun Chan Young,
A Great Catholic Person, Dapengzhang0, Fenwang0102, Saritaloves, Poopoo124328, Crpcls85, Loraof, Julietdeltalima, JQTriple7, Me-
diavalia, Joseph2302, Zortwort, Deunanknute, Gustavo costa123, Jimwearsahatbutdoesn'thaveacat, EternalNomad, MusikBot, JJMC89,
Tamtam90, Lr0^^k, Tyler Boro, Prevalence, Baking Soda, Bashmakov Rustem, WiKaffiN, Ninjya3, RollaInstituiteOfTechnology, Math-
YingZhou, RamiGrossberg, GreenC bot, John Guillaume, Fixmaster, Hilbertmonkey, Jacobnt91, EeeveeeFrost, Mm-adini, Bender the Bot,
Editor111442, Jdavidson44441616 and Anonymous: 265

7.2 Images
• File:Lock-green.svg Source: https://upload.wikimedia.org/wikipedia/commons/6/65/Lock-green.svg License: CC0 Contributors: en:File:
Free-to-read_lock_75.svg Original artist: User:Trappist the monk
• File:Question_book-new.svg Source: https://upload.wikimedia.org/wikipedia/en/9/99/Question_book-new.svg License: Cc-by-sa-3.0
Contributors:
Created from scratch in Adobe Illustrator. Based on Image:Question book.png created by User:Equazcion Original artist:
Tkgd2007

7.3 Content license

• Creative Commons Attribution-Share Alike 3.0