olymmath

ILL 1967 Problem 20

    In the space n≥3n \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.

    Dataset text AoPS wiki problems. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator ill/1967/p20 · Tag VQVKGTSN5V · Edit this page on GitHub · Keys: j next, k previous