olymmath

KöMaL 2020 B5130

    There are nn points in the plane. We know that for any kk points (k≥2k\ge 2), it is possible to select two of them with distance at most 1. Show that the points can be covered with k−1k-1 disks of unit radius.

    Official text KöMaL. 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 hu-komal/2020/b5130 · Tag 2GAMM062K6 · Edit this page on GitHub · Keys: j next, k previous