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.

2 shown

B Optimisation

Packing equal circles in a unit square

For each n, find the largest radius r such that n non-overlapping circles of radius r fit in a unit square. Optimality is proven only for small n. For larger n, improve the best known packings or prove new cases optimal.

0claims
0verified
B Optimisation

The Thomson problem (minimum-energy charges on a sphere)

Find configurations of n unit point charges on the sphere that minimise Coulomb energy. Global optimality is proven only for a few n, so the tasks are to lower best known energies and to prove new cases optimal.

0claims
0verified

Browse by field