olymmath

CAPS 2019 Problem 5

    Determine whether there exist 100100 disks D2,D3,…,D101D_2,D_3,\ldots ,D_{101} in the plane such that the following conditions hold for all pairs (a,b)(a,b) of indices satisfying 2≤a<b≤1012\le a< b\le 101 :

    • If a∣ba|b then DaD_a is contained in DbD_b .
    • If gcd⁡(a,b)=1\gcd (a,b)=1 then DaD_a and DbD_b are disjoint.

    (A disk D(O,r)D(O,r) is a set of points in the plane whose distance to a given point OO is at most a given positive real number rr .)

    Dataset text AI-MO AoPS. 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 caps/2019/p5 · Tag QDW0K6KAEH · Edit this page on GitHub · Keys: j next, k previous