IMO Shortlist 1967 problem 2


Kvaliteta:
  Avg: 4,0
Težina:
  Avg: 2,0
Dodao/la: arhiva
2. travnja 2012.
LaTeX PDF
In the space n \geq 3 points are given. Every pair of points determines some distance. Suppose all distances are different. Connect every point with the nearest point. Prove that it is impossible to obtain (closed) polygonal line in such a way.
Izvor: Međunarodna matematička olimpijada, shortlist 1967