$N \ge 3$ different points are marked on the plane. It is known that among pairwise distances between marked points there are not more than $n$ different distances. Prove that $N \le (n + 1)^2$.
Source:
Tags: geometry, combinatorics, combinatorial geometry
$N \ge 3$ different points are marked on the plane. It is known that among pairwise distances between marked points there are not more than $n$ different distances. Prove that $N \le (n + 1)^2$.