Erdős Problem 213 #
Reference: erdosproblems.com/213
The predicate (on $n$) that there exist $n$ points in $\mathbb{R}^2$, no three on a line and no four on a circle, such that all pairwise distances are integers?
Equations
- One or more equations did not get rendered due to their size.
Instances For
Let $n ≥ 4$. Are there $n$ points in $\mathbb{R}^2$, no three on a line and no four on a circle, such that all pairwise distances are integers?
The best construction to date, due to Kreisel and Kurz, has $n = 7$.