20. (HUN 1) In space, 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 a polygonal line in such a way.
Solution
20. The statement so formulated is false. It would be true under the additional assumption that the polygonal line is closed. However, from the offered solution, which is not clear, it does not seem that the proposer had this in mind.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.