Maths Olympiad Prep

Library / /8 of 13

, 2011

Geometry Difficulty 6.6 National olympiad Prove it Vietnam

Given a convex pentagon ABCDEABCDE, of which the length of each edge and of the diagonals ACAC, ADAD does not exceed 3\sqrt{3}. Choose 2001 arbitrary distinct points in the interior of that pentagon. Show that there exists a unit disk with center lying on the edges of the pentagon, which contains at least 403 of the chosen points.

Solution

To verify the claim, we will show that it is possible to cover the pentagon ABCDEABCDE by 5 unit discs with center lying on the edges of the pentagon.

We have following remark:
Remark: It is possible to cover a triangle XYZXYZ with edges of length not exceeding 3\sqrt{3} by 3 unit discs with centers at the vertices of the triangle.

Proof: Assuming the contrary, there exists a point MM belonging to triangle XYZXYZ but not lying in the unit discs with centers at the vertices of the triangle. Then we have MX>1MX > 1, MY>1MY > 1 and MZ>1MZ > 1.

Clearly, among the angles XMY^\widehat{XMY}, YMZ^\widehat{YMZ} and ZMX^\widehat{ZMX} at least one is larger than 120120^\circ. Without loss of generality, assume that XMY^120\widehat{XMY} \ge 120^\circ. Using the cosine theorem for triangle XMYXMY, we obtain
XY2=MX2+MY22MXMYcosXMY^>1+1+212=3(since cosXMY^12). XY^2 = MX^2 + MY^2 - 2MX \cdot MY \cdot \cos \widehat{XMY} > 1 + 1 + 2 \cdot \frac{1}{2} = 3 \quad (\text{since } \cos \widehat{XMY} \le -\frac{1}{2}).
Consequently XY>3XY > \sqrt{3}, contradicting the assumption. The contradiction yields the claim to be verified.

Since the triangles ABCABC, ACDACD and ADEADE have edges with length less than 3\sqrt{3}, according to the remark, they can be covered by the triples of unit discs ((A),(B),(C))((A), (B), (C)), ((A),(C),(D))((A), (C), (D)) and ((A),(D),(E))((A), (D), (E)). Hence the pentagon ABCDEABCDE is covered by 5 unit discs with center at the vertices of the pentagon. According to Dirichlet's principle, among the 5 discs there exists one containing at least 403 of the chosen points. ■

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.