MathsClub Problems, proofs & good company

The Problems

Not schoolwork — the questions that resisted Erdős, Hilbert, and everyone since. The club keeps three shelves: what is still open, what AI recently settled, and what took humanity centuries.

Difficulty 5/5 — 50 shown. Clear

Jaeger's summit conjecture: every bridgeless cubic graph maps into the Petersen graph — implying cycle double cover, Berge–Fulkerson, and five-flow at once.

Posed by François Jaeger · 1988 · Graph theory · difficulty 5/5

graph-theory cubic-graphs

Szpiro's discriminant–conductor inequality for elliptic curves: equivalent to abc, claimed via inter-universal Teichmüller theory, but the proof is disputed and the problem stays open.

Posed by Lucien Szpiro · 1981 · Arithmetic geometry · difficulty 5/5

arithmetic-geometry elliptic-curves abc

Small doubling forces approximate linear structure with polynomial — not exponential — losses. Conjectured for decades; proved by Gowers–Green–Manners–Tao in November 2023.

· Additive combinatorics · resolved 2023 · difficulty 5/5

additive-combinatorics

Lars Onsager predicted in 1949 that rough fluid flows can dissipate energy without viscosity below Hölder exponent 1/3, but not above. Proved in full by 2018 via convex integration.

Posed by Lars Onsager · 1949 · PDEs / fluid dynamics · resolved 2018 · difficulty 5/5

pdes fluid-dynamics turbulence convex-integration

The permanent needs superpolynomial arithmetic circuits (VP ≠ VNP). Algebraic complexity's founding question, open since 1979.

Posed by Leslie Valiant · 1979 · algorithms / linear algebra · difficulty 5/5

complexity-theory

A planar set of dimension > 1 determines a positive-measure set of distances. Conjectured threshold d/2; plane record 5/4 — Kakeya's distance cousin.

· geometric measure theory / harmonic analysis · difficulty 5/5

harmonic-analysis

Can an algorithm decide rational solvability of Diophantine equations? Solved negatively over the integers (1970); over the rationals, wide open.

· mathematical logic / number theory · difficulty 5/5

mathematical-logic

The cube minimises volume times polar volume among symmetric convex bodies. Proved through dimension 3; open from dimension 4 up.

· convex geometry / Banach space theory · difficulty 5/5

convex-geometry

A locally compact group acting faithfully on a manifold must be Lie. Hilbert's fifth problem, one level up — settled for Lipschitz and 3D actions, open in general.

· topological groups / Lie theory · difficulty 5/5

lie-theory

Constant nonzero Jacobian implies global polynomial invertibility. Settled in two variables, open in three and above; stably equivalent to Dixmier's conjecture.

Posed by Ott-Heinrich Keller · 1939 · algebraic geometry · difficulty 5/5

affine-geometry

Preperiodic points of a degree-d map over a bounded-degree number field are uniformly bounded. The dynamical analogue of Merel's theorem — open in every degree ≥ 2.

Posed by Patrick Morton / Joseph Silverman · 1994 · arithmetic dynamics · difficulty 5/5

arithmetic-dynamics

Special L-values at s = 0 encode explicit units generating class fields. The rank-one abelian case fell recently (Dasgupta–Kakde); the full conjectures stand.

Posed by Harold Stark · algebraic number theory · difficulty 5/5

l-functions

Every endomorphism of the first Weyl algebra is an automorphism. Open since 1968 and stably equivalent to the Jacobian conjecture — the two fall together.

Posed by Jacques Dixmier · 1968 · algebra · difficulty 5/5

noncommutative-algebra

The Möbius function is orthogonal to every deterministic system of zero entropy. Open in general; implied by Chowla's conjecture and consistent with all known short-interval results.

Posed by Peter Sarnak · ergodic theory / topological dynamics · difficulty 5/5

ergodic-theory

Simultaneous primality for linear forms with no local obstruction — the linear case of Schinzel's Hypothesis H, covering twin primes and prime k-tuples. Every nontrivial case is open.

Posed by Leonard Eugene Dickson · 1904 · number theory · difficulty 5/5

prime-patterns

Polynomials with no local obstruction take simultaneous prime values infinitely often. The master conjecture behind twin primes, Sophie Germain primes and prime k-tuples — every nonlinear case open.

Posed by Andrzej Schinzel / Wacław Sierpiński · 1958 · number theory · difficulty 5/5

prime-patterns

The K-theory of a reduced group C*-algebra should equal the equivariant K-homology of the classifying space for proper actions. Proven for large classes of groups; false in full generality with coefficients — the counterexamples reveal deep connections to geometric group theory.

Posed by Paul Baum / Alain Connes · 1982 · operator algebras / representation theory · difficulty 5/5

Near the percolation threshold, cluster sizes follow power laws with universal exponents. In d=2 they are rigorously known via SLE; in d ≥ 6 mean-field exponents hold by the lace expansion. In between: not a single exponent has been proven.

· probability theory / statistical mechanics · difficulty 5/5

Equations \(x^p\) + \(y^q\) = \(z^r\) with coprime terms and reciprocal exponents summing below 1 should have only finitely many primitive solutions across ALL exponent choices. Faltings proves finiteness per-triple; uniformity is the gap.

· number theory · difficulty 5/5

Every finite simple group is either cyclic of prime order, an alternating group, a Lie-type group, or one of 26 sporadic groups. ~100 authors, 500+ journal pages, spanning 50 years — the largest collaboration in pure mathematics before Polymath.

Posed by collective programme emerging from Burnside, Frobenius, Hölder era · 1900 · group theory · resolved 2004 · difficulty 5/5

Deligne's proof of the last Weil conjecture established RH for function fields over ANY finite field — the theorem that earned his Fields Medal and revolutionised algebraic geometry via étale cohomology.

· arithmetic geometry · resolved 1974 · difficulty 5/5

Curves of genus ≥ 2 over the rationals have only FINITELY many rational points. Faltings proved it in 1983, won the Fields Medal, and left effectiveness as the field's enduring homework.

Posed by Louis Mordell · 1922 · arithmetic geometry · resolved 1983 · difficulty 5/5

Every elliptic curve over the rationals arises from a modular form. The full theorem — completing the bridge that felled Fermat's Last Theorem — was finished by Breuil, Conrad, Diamond and Taylor six years after Wiles' semistable case.

Posed by Yutaka Taniyama / Goro Shimura (with Weil's reformulation) · 1955 · arithmetic geometry · resolved 2001 · difficulty 5/5

Counting solutions of equations over finite fields should follow deep topology: zeta functions satisfy RH-analogues because varieties behave like classical manifolds. Deligne's 1974 proof reshaped everything.

Posed by André Weil · 1949 · algebraic geometry / number theory · difficulty 5/5

zeta-functions

A precise promise problem about labelling cycles of pairwise consistency checks that is believed (was believed?) NP-hard — and became the load-bearing assumption for half of optimal-inapproximability theory.

Posed by Subhash Khot · 2002 · theoretical computer science · difficulty 5/5

γ = lim(1+1/2+...+1/n − log n) ≈ 0.5772…: we cannot even prove it is IRRATIONAL, let alone transcendental. Mathematics' most embarrassing constant.

Posed by implicit in Leonhard Euler's work · 1735 · number theory · difficulty 5/5

Algebraic subvarieties should be visible in étale cohomology: which cohomology classes come from actual cycles? The arithmetic mirror of the Hodge conjecture, and nearly as stubborn.

Posed by John Tate · 1965 · arithmetic geometry · difficulty 5/5

algebraic-cycles

Primes are equidistributed in arithmetic progressions on average up to modulus \(q^{1−ε}\) for EVERY ε — twice the reach of the Bombieri–Vinogradov theorem. Half the modern theory of primes leans on this doubling.

Posed by Peter D. T. A. Elliott / Heini Halberstam · 1968 · analytic number theory · difficulty 5/5

prime-distribution

The Liouville function λ(n) should look random: correlations \sum_{n≤x} λ(n+h_1)...λ(n+h_k) should be o(x) for any fixed shifts. Two-point progress exists; three points and beyond resist.

Posed by Sarvadaman Chowla · 1965 · analytic number theory · difficulty 5/5

multiplicative-functions

The E₈ and Leech lattices are THE tightest packings of balls in their dimensions — proven by Maryna Viazovska\'s magic modular-form functions in a fortnight that stunned mathematics.

· discrete geometry · resolved 2016 · difficulty 5/5

How wildly does the Riemann zeta function grow on the critical line? Lindelöf said barely at all — a consequence of RH that may be provable even without it.

Posed by Ernst Leonard Lindelöf · 1908 · analytic number theory · difficulty 5/5

l-functions

How far apart can consecutive primes be? Cramér's probabilistic model says never much more than (log p)² — a prediction we cannot approach unconditionally.

Posed by Harald Cramér · 1936 · analytic number theory · difficulty 5/5

prime-gaps probabilistic-models

Does every graph needing k colours contain k pairwise vertex-disjoint connected subgraphs mutually joined by edges? One conjecture that would explain ALL of colouring.

Posed by Hugo Hadwiger · 1943 · graph theory · difficulty 5/5

graph-minors

How algebraically independent can exponentials of numbers be? The master key to transcendence — prove it and Lindemann-Weierstrass, four-exponentials and much more fall out at once.

Posed by Stephen Schanuel · 1965 · transcendental number theory · difficulty 5/5

transcendence

Is there a cardinality strictly between the integers and the reals? The first Hilbert problem dissolved into independence: yes in Gödel\'s universe, no in Cohen\'s — and both are legitimate.

Posed by Georg Cantor · 1878 · set theory / foundations · resolved 1963 · difficulty 5/5

independence

Is the 4-sphere, up to diffeomorphism, the unique smooth closed simply-connected 4-manifold? Topology says yes; smooth structures say nobody knows — and dimension four is where smoothness goes feral.

· differential topology · difficulty 5/5

4-manifolds

a + b = c: how large can the radical of abc be relative to c? A statement about the deep tension between addition and multiplication — and home of mathematics' most controversial claimed proof.

Posed by Joseph Oesterlé / David Masser · 1985 · number theory · difficulty 5/5

diophantine-equations

More problems →