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
Establish, check and extend rigorous computer-assisted proofs that smooth solutions of the 3D incompressible Euler equations (and related models) develop singularities in finite time.
Lower the known upper bound Λ ≤ 0.2 for the de Bruijn–Newman constant. The Riemann Hypothesis is equivalent to Λ = 0, and Λ ≥ 0 is known.
