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 2/5 — 6 shown. Clear

Iterated absolute differences of the primes always start with 1. Verified to 10^13 and beyond, proved nowhere — perhaps the most elementary open problem about the primes.

Posed by Norman Gilbreath · 1958 · Prime numbers · difficulty 2/5

prime-numbers elementary

Chomp is a first-player win, but nobody knows the winning first move in general. Strategy-stealing proves existence; explicit strategy unknown.

· combinatorial game theory · difficulty 2/5

combinatorial-games

In ANY triangle, the three adjacent angle trisectors meet pairwise at the vertices of an equilateral triangle. Discovered around 1874, published 1899 — pure Euclidean magic with no construction possible by compass alone.

Posed by Frank Morley · 1899 · classical Euclidean geometry · resolved 1899 · difficulty 2/5

How often can the SAME integer appear in Pascal's triangle? Singmaster guessed a uniform bound; the number 3003 appears six times and nobody can rule out seven.

Posed by David Singmaster · 1975 · combinatorial number theory · difficulty 2/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

Trisect the angle, double the cube, square the circle — compass and straightedge alone. Two millennia of failure resolved by nineteenth-century algebra: all three are impossible, and the proofs founded modern field theory.

· classical geometry / algebra · resolved 1882 · difficulty 2/5