The problem
Let denote the largest constant for which one has
for all non-negative . What is ?
Statement quoted from problem 2 of the AlphaEvolve repository of problems (Google DeepMind, CC BY 4.0).
What AI did
AlphaEvolve found a construction that improved on the best bound known at the time; the problem itself remains open. Status in the repository: New result. See Section 6.2 in "Mathematical Exploration and Discovery at Scale" paper. Records may have moved since; the repository's notes below list the latest bounds it knows of.
Notes from the repository
Upper bounds for
| Bound | Source | Date |
|---|---|---|
| Schinzel-Schmidt | 2002 | |
| Matolcsi-Vinuesa | 8 Jul 2009 | |
| Georgiev-Gómez-Serrano-Tao-Wagner [Colab 1] [Colab 2] | 14 May 2025 | |
| Georgiev-Gómez-Serrano-Tao-Wagner [Colab 1] [Colab 2] | 20 Dec 2025 | |
| Yuksekgonul et al. | Jan 2026 |
Lower bounds for
| Bound | Source | Date |
|---|---|---|
| Trivial | ||
| Martin-O'Bryant | 30 Sep 2004 | |
| Martin-O'Bryant | 1 Apr 2009 | |
| Matolcsi-Vinuesa | 8 Jul 2009 |
See also Damek Davis's meta-analysis of this problem.
How it was checked
The results are explicit constructions or programs; the repository's notebooks include the verification code used to score them.
Limitations
An improved bound is progress, not a solution: the exact answer to the problem is still unknown. The authors report that results were better when experts set up and guided the search.
∎