A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
A power improvement in the Heilbronn triangle problem
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Color the Plane <<<

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.5 out of 5 (5,531 votes)

>>> How to Play <<<
A power improvement in the Heilbronn triangle lower bound. For every sufficiently large n, constructs n points in the unit square such that every triangle has area at least $n^{-2+c}$ for one absolute c > 0. This disproves the conjectured almost-n−2 upper bound in Heilbronn's triangle problem, which asks how large the smallest determined triangle can be.

>>> Level Select <<<
released 2026-09-25  |  1 theorem · 16 lemmas · 22 proofs · 9,744 words  |  PLAY LEVEL 1 »  (pdf)
There are absolute constants $\eta,c_1\gt 0$ such that, for every sufficiently large integer n, one can choose n points in the unit square so that every triangle they determine has area at least $c_1n^{-2+\eta}$. Thus the almost n−2 upper-bound formulation of Heilbronn's triangle problem is false. The exponent η is fixed but extremely small.

More Combinatorics Games!
Combinatorial invariance of Kazhdan–Lusztig polynomialsThe Shareshian–Wachs $e$-positivity conjectureSharp logarithmic exponents for off-diagonal Ramsey numbers HOT!The hypercube Ramsey conjecture
Classification of finite Euclidean Ramsey configurationsSeymour's second-neighborhood conjecture HOT!Deterministic construction of strong thin spanning treesTalagrand's conjectures and graph decompositions at expectation thresholds

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