MathDB
The coin covering problem..., but with a twist

Source: LMAO 2024 P6

June 1, 2024
combinatoricsgeometrylmaocombinatorial geometry

Problem Statement

There are n>1n > 1 distinct points marked in the plane. Prove that there exists a set of circles C\mathcal C such that
[color=#FFFFFF]___\bullet Each circle in C\mathcal C has unit radius. [color=#FFFFFF]___\bullet Every marked point lies in the (strict) interior of some circle in C\mathcal C. [color=#FFFFFF]___\bullet There are less than 0.3n0.3n pairs of circles in C\mathcal C that intersect in exactly 22 points.
Note: Weaker results with 0.3n\it{0.3n} replaced by cn\it{cn} may be awarded points depending on the value of the constant c>0.3\it{c > 0.3}.
Proposed by Siddharth Choppara, Archit Manas, Ananda Bhaduri, Manu Param