olymmath

ILL 1974 Problem 19

    Prove that there exists, for n≥4n \geq 4 , a set SS of 3n3n equal circles in space that can be partitioned into three subsets s5,s4s_5, s_4 , and s3s_3 , each containing nn circles, such that each circle in srs_r touches exactly rr circles in S.S.

    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 ill/1974/p19 · Tag Z7FER0S2Z9 · Edit this page on GitHub · Keys: j next, k previous