Problem 659

Erdős Problem #659: declared status 'proved'. Formalized: yes. Is there a set of $n$ points in $\mathbb{R}^2$ such that every subset of $4$ points determines at least $3$ distances, yet the total number of distinct distances is$$\ll \frac{n}{\sqrt{\log n}}?$$ Prize: no. Tags: distances, geometry.