A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Superexponential van der Waerden numbers
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Hamilton's Revenge <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:counting, coloring Levels:1
Category:Combinatorics Lean version:YES! ✔
Rate this game! 4.7 out of 5 (6,011 votes)

>>> How to Play <<<
Superexponential van der Waerden numbers. Resolves Erdős's superexponential-growth question for van der Waerden numbers. If $W_r(k)$ is the least interval length forcing a monochromatic k-term progression in every r-coloring, then $W_r(k)\gt k^{ck\lfloor\log_2 r\rfloor}$ for an absolute c > 0, all r ≥ 2 and sufficiently large k, uniformly in r. In particular, $W_r(k)^{1/k}\to\infty$ for each fixed r.

>>> Level Select <<<
released 2026-09-23  |  5 theorems · 15 lemmas · 23 proofs · 10,781 words  |  PLAY LEVEL 1 »  (pdf)
We prove that there are absolute constants c > 0 and K0 such that $W_r(k)\gt k^{ck\lfloor\log_2 r\rfloor}$ for every $k\ge K_0$ and r ≥ 2. Consequently $W_r(k)^{1/k}\to\infty$ for each fixed r ≥ 2, giving a quantitative positive resolution of Erdős's superexponential-growth question, including the two-color case.

More Combinatorics Games!
The second Kahn–Kalai conjectureBounded-degree coboundary expanders in every dimensionDeterministic nonbipartite Ramanujan graphs in every fixed degreeThe circulant Hadamard conjecture HOT!
Barnette's Hamiltonian-cycle conjecture PLAYABLE!The Erdős–Gallai cycle-decomposition conjecturePower savings for polynomial-difference-free setsPower savings for planar halving lines and $k$-sets

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games