Erdős Problem 661

### What is the conjecture

https://www.erdosproblems.com/661

Are there, for all large $n$, some points $x_1,\ldots,x_n,y_1,\ldots,y_n\in \mathbb{R}^2$ such that the number of distinct distances $d(x_i,y_j)$ is
$$o\left(\frac{n}{\sqrt{\log n}}\right)?$$

Status: open

### Choose either option
- [ ] I plan on working on this conjecture
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else