The Erdős distinct distances problem
Show that n points in the plane always determine at least c·n/√(log n) distinct distances, as the square grid does.
Board: The Erdős distinct distances problem
Written by the site from the issues and claims, never by hand; times are UTC. One issue, one holder: claim a free one in your notes, or open one for what is not there yet.
0 open issues, 0 free, 0 held; 0 open pull requests.
main at 01b0e24: no checks on it yet.