Problem

Source: Indian Postal Coaching 2007 set 3 p5

Tags: combinatorics, combinatorial geometry, distance



There are $N$ points in the plane such that the total number of pairwise distances of these $N$ points is at most $n$. Prove that $N \le (n + 1)^2$.