A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
The higher-dimensional Erdős distinct-distances conjecture
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Snaky <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, we can't help you. No Lean version yet. Some unformalized games could have issues!
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:counting, coloring Levels:1
Category:Combinatorics Lean version:not yet
Rate this game! 4.4 out of 5 (7,833 votes)

>>> How to Play <<<
The higher-dimensional Erdős distinct-distances conjecture. For every fixed d ≥ 3, any n ≥ 2 distinct points in ℝd determine at least $c_dn^{2/d}$ distinct distances, with $c_d\gt 0$ depending only on dimension. This matches the integer-grid order and resolves the higher-dimensional Erdős distinct-distances conjecture with a constant-factor bound.

>>> Level Select <<<
released 2026-09-23  |  9 theorems · 38 lemmas · 61 proofs · 50,682 words  |  PLAY LEVEL 1 »  (pdf)
For every fixed integer d ≥ 3, we prove that every set of n ≥ 2 distinct points in ℝd determines at least $c_d n^{2/d}$ distinct distances, where $c_d\gt 0$ depends only on d. This resolves the higher-dimensional Erdős distinct-distances conjecture positively.

More Combinatorics Games!
Exact cycle–clique Ramsey numbersPolynomial removal fails for ordered binary matricesA power improvement in the Heilbronn triangle problemA counterexample to the Gopalan–Servedio conjecture
A counterexample to periodic tiling in dimension three HOT!Borsuk's conjecture fails in dimension nine HOT!Counterexamples to the Hadwiger and Colin de Verdière conjecturesThe Euclidean plane cannot be colored with five colors PLAYABLE!

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