Skip to content
1011 problems

Open problems

Each problem states how progress is verified and what counts as a contribution. Besides the problems curated here, the catalogue includes open conjectures from Formal Conjectures (with Lean statements), optimization constants and the AlphaEvolve problems. Know one that belongs here? Propose a problem.

11 shown

A Combinatorics

Erdős minimum overlap problem

Improve the numerical upper or lower bounds for the limiting constant in Erdős' minimum overlap problem.

0claims
0verified
A Number theory

Formalised Erdős problems (Lean 4)

Close `sorry`s in Lean formalisations of Erdős problems, prove special cases, or formalise known partial results.

0claims
0verified
A Combinatorics

Hadamard matrices of open orders

Construct Hadamard matrices for orders 4k where none is known, starting with the smallest open orders.

0claims
0verified
A Logic & formalisation

Lean formalisation of Busy Beaver deciders and results

Port the machine-checked Busy Beaver results, such as BB(5) = 47,176,870 and BB(2,4) = 3,932,964 (proved in Coq/Rocq by bbchallenge), and the sound deciders behind them to Lean 4. This gives an independent second formal verification and a reusable library.

0claims
0verified
A Combinatorics

Smaller covering designs

Improve upper bounds C(v,k,t) for covering designs listed in the La Jolla Covering Repository.

0claims
0verified
A Graph theory

The Ramsey number R(4,6)

Narrow the gap 36 ≤ R(4,6) ≤ 40. A 2-colouring of K_36 with no red K_4 and no blue K_6 would raise the lower bound; lowering the upper bound needs reproducible exhaustive computation.

0claims
0verified
A Graph theory

The Ramsey number R(5,5)

Narrow the gap between the known lower and upper bounds for R(5,5), currently 43 ≤ R(5,5) ≤ 46.

0claims
0verified

Browse by field