Maths Olympiad Prep

Track / Stage 5 / 372 of 400 #1452 of 2444

Problem 1452

AIME late
Combinatorics Difficulty 5.9 Prove it Hong Kong competition problems · Hong Kong · 2016

2016 circles with radius 11 are lying on the plane. Among these 20162016 circles, show that one can select a collection CC of 2727 circles satisfying the following: either every pair of two circles in CC intersects or every pair of two circles in CC does not intersect.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Suppose there do not exist 2727 circles such that every pair of circles intersects.

Consider a coordinate plane such that the line joining any pair of centres of the circles is not parallel to the coordinate axes. We label the circles as Γ1,Γ2,,Γ2016\Gamma_1, \Gamma_2, \dots, \Gamma_{2016} such that the xx-coordinate of the centre of Γi\Gamma_i is less than that of Γj\Gamma_j if i<ji < j.

Figure 1

Consider one of the circles Γk\Gamma_k. Let Γ\Gamma be the circle with radius 22 and having the same centre as Γk\Gamma_k. Partition the left semicircle of Γ\Gamma into 33 sectors of 6060^\circ. Then the distance between any two points in the same sector is at most 22. If there are 2626 centres of the other circles belonging to the same sector, then these circles together with Γk\Gamma_k satisfy the condition, since the distance between any two of these centres is at most 22, which shows the two circles intersect. Thus, we may assume there are at most 2525 centres in each sector. This implies at most 7575 centres among Γ1,Γ2,,Γk1\Gamma_1, \Gamma_2, \dots, \Gamma_{k-1} lie in Γ\Gamma, or equivalently at most 7575 of these circles intersect Γk\Gamma_k.

Now, we colour the circles Γ1,Γ2,,Γ2016\Gamma_1, \Gamma_2, \dots, \Gamma_{2016} one by one in 7676 colours. Suppose we have coloured Γ1,Γ2,,Γk\Gamma_1, \Gamma_2, \dots, \Gamma_k. Since Γk+1\Gamma_{k+1} intersects at most 7575 of the previous circles, we can colour it in a way such that its colour is different from the colours of all circles among Γ1,Γ2,,Γk\Gamma_1, \Gamma_2, \dots, \Gamma_k which intersect Γk+1\Gamma_{k+1}. By the pigeonhole principle, we can find
201676=27 \left\lfloor \frac{2016}{76} \right\rfloor = 27
circles having the same colour. This means these 2727 circles are pairwise disjoint. So we are done.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.