Permanent problem IDPPL 041
Distances
Let A⊂ ℝ^2 be a set of n points. Must there be two distances which occur at least once but between at most n pairs of points? Must the number of such distances → ∈fty as n→ ∈fty?
Let A⊂ ℝ^2 be a set of n points. Must there be two distances which occur at least once but between at most n pairs of points? Must the number of such distances → ∈fty as n→ ∈fty?
A solution must appear in a reputable journal, with documentation that Erdős offered the displayed amount. Claims are administered by the Combinatorics Foundation; erdosproblems.com does not pay awards.