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.

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

Every root of a polynomial with all roots in the unit disk should lie within distance 1 of SOME critical point. Gauss-Lucas says critical points live in the disk; Sendov asks for the finer choreography.

Posed by Blagovest Sendov · 1958 · complex analysis / polynomial roots · difficulty 3/5

Can a graph drawn so that every edge meets every other edge exactly once have more edges than vertices? Conway bet $1,000 nobody finds one.

Posed by John H. Conway · 1969 · combinatorial geometry / graph drawing · difficulty 2/5

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

How few distinct distances must n plane points determine? Guth and Katz nearly closed it in 2010 — leaving only a logarithm standing between us and the answer.

Posed by Paul Erdős · 1946 · combinatorial geometry / incidence geometry · difficulty 4/5

The last survivor: after the three-variable case fell to a 216-character counterexample in 2026, the ORIGINAL two-variable Jacobian question remains open.

Posed by Heinz Otto Keller · 1939 · polynomial mappings / algebraic geometry · difficulty 4/5

Can you always rebuild a graph from its deck of vertex-deleted cards? Ulam-style determinism for combinatorial structure — open for over eighty years.

Posed by Paul J. Kelly / Stanisław Ulam · 1941 · graph theory · difficulty 3/5

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

\(A^x\) + \(B^y\) = \(C^z\) with all exponents greater than 2 forces a common factor among the bases. Fermat's Last Theorem's living descendant, with a million-dollar bounty.

Posed by Andrew Beal · 1993 · number theory · difficulty 4/5

exponential-diophantine

Perfect numbers equal the sum of their proper divisors. Euclid knew even ones come from Mersenne primes; whether an odd perfect number exists has outlived twenty-three centuries.

· number theory · difficulty 4/5

divisor-function

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 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

Colour the edges of complete graphs red/blue: how large before a monochromatic K₅ is forced? For K₅ versus K₅ we know only 43 ≤ R(5,5) ≤ 48.

· Ramsey theory · difficulty 3/5

ramsey-numbers

In any non-empty family of sets closed under union, must some element appear in at least half the sets? Perhaps the simplest open statement in extremal set theory.

Posed by Péter Frankl · 1978 · combinatorics · difficulty 3/5

extremal-combinatorics

What is the least exponent ω with n×n matrices multipliable in O(n^ω) operations? Fifty-six years of algebraic ingenuity brought ω from 3 down toward 2 — never reaching it.

Posed by Volker Strassen (framed by the 1969 breakthrough) · 1969 · algorithms / linear algebra · difficulty 4/5

algebraic-complexity

How large can a subset of \(F_3^n\) be containing no three-term arithmetic progression? Bounds have collapsed twice — once by the polynomial method, once to DeepMind's FunSearch.

· additive combinatorics · difficulty 4/5

additive-combinatorics

Can every fraction 4/n be written as a sum of exactly three unit fractions? Egyptian mathematics meets the distribution of prime factors.

Posed by Paul Erdős / Ernst G. Straus · 1948 · number theory · difficulty 3/5

egyptian-fractions

Does every simple closed curve in the plane contain four points forming a square? Over a century old, proven true for vast classes of curves, false for none.

Posed by Otto Toeplitz · 1911 · topology · difficulty 3/5

jordan-curves

How many colours suffice so that no two points exactly one unit apart share a colour? Between five and seven since 2018 — when Aubrey de Grey shook a 70-year-old stalemate.

· combinatorial geometry · difficulty 4/5

chromatic-number

n runners start together on a circular track, each with a distinct constant speed. Must every runner, at some moment, be strictly farther than 1/n of the track from all the others?

Posed by Jörg M. Wills / (popularised by Goddyn) · 1968 · dynamical systems / number theory · difficulty 3/5

diophantine-approximation

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

Does every bounded linear operator on a Hilbert space send some non-trivial closed subspace to itself? Fifty years of counterexamples on wilder spaces, two unrefereed claims on Hilbert space itself — and still no verdict.

Posed by roots in von Neumann; modern form due to Paul Halmos · 1949 · functional analysis / operator theory · difficulty 5/5

operator-theory

How small can a set be that contains a unit line segment pointing in every direction? Dimension three fell in 2025 in a proof hailed as a once-in-a-century achievement; dimension four and beyond remain open.

Posed by Sōichi Kakeya (needle problem); modern form via Besicovitch & Perron trees · 1917 · geometric measure theory / harmonic analysis · difficulty 5/5

harmonic-analysis

Give the quantum field theory behind the Standard Model a rigorous foundation, and explain why the gluon is massive despite being massless in the equations.

· mathematical physics · $1M Clay Millennium Prize · difficulty 5/5

quantum-field-theory

On algebraic varieties, the analytic topology and the algebraic geometry see the same cycles. Whether they truly align is one of geometry's deepest gaps.

Posed by William Vallance Douglas Hodge · 1950 · algebraic geometry · $1M Clay Millennium Prize · difficulty 5/5

algebraic-geometry

Every even integer greater than 2 is the sum of two primes. The oldest surviving unsolved problem in number theory.

Posed by Christian Goldbach / Leonhard Euler · 1742 · number theory · difficulty 5/5

additive-number-theory

Take any positive integer: halve it if even, else triple it and add one. Does the sequence always reach 1?

Posed by Lothar Collatz · 1937 · dynamical systems / number theory · difficulty 5/5

dynamical-systems

If a solution can be checked quickly, can it also be found quickly? The question that organises theoretical computer science.

Posed by Stephen Cook / Leonid Levin · 1971 · computational complexity · $1M Clay Millennium Prize · difficulty 5/5

complexity-theory

All non-trivial zeros of the Riemann zeta function lie exactly on the critical line Re(s) = 1/2. The single most consequential open statement in pure mathematics.

Posed by Bernhard Riemann · 1859 · analytic number theory · $1M Clay Millennium Prize · difficulty 5/5

l-functions prime-distribution