Problem 670

Erdős Problem #670: declared status 'open'. Formalized: no. Let $A\subseteq \mathbb{R}^d$ be a set of $n$ points such that all pairwise distances differ by at least $1$. Is the diameter of $A$ at least $(1+o(1))n^2$? Current best: The lower bound of $\binom{n}{2}$ for the diameter is trivial. Prize: no. Tags: distances, geometry.