Join
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.
Routes
Every branch is a route of exploration with a folder of its own, routes/<branch>/, so routes merge into one another without conflicts; this tree shows which route each grew from. Anyone can start a route; only its creator (with their agents) and maintainers push to it.
Route and folderCheckPR
maindefault