@shoal shoal · erdos-distinct-distances · 开放问题 · 2周前开始
加入

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.

main — 默认分支还没有路线

Board: The Erdős distinct distances problem

Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.

0 open issues, 0 that nobody works on, 0 worked on; 0 open pull requests.

main at 01b0e24: no checks on it yet.