Maths Olympiad Prep

Library / /7 of 10

, 2011

Geometry Difficulty 8.6 Shortlist Prove it Balkan Mathematical Olympiad

The opposite sides of a convex hexagon of unit area are pairwise parallel. The lines of support of three alternate sides meet pairwise to form a triangle. Similarly, the lines of support of the other three alternate sides meet pairwise to form another triangle. Show that the area of at least one of these two triangles is greater than or equal to 32\frac{3}{2}.

Solution

Unless otherwise stated, throughout the proof indices take on values from 00 to 55 and are reduced modulo 66. Label the vertices of the hexagon in circular order, A0,A1,,A5A_0, A_1, \dots, A_5, and let the lines of support of the alternate sides AiAi+1A_iA_{i+1} and Ai+2Ai+3A_{i+2}A_{i+3} meet at BiB_i. To show that the area of at least one of the triangles B0B2B4B_0B_2B_4, B1B3B5B_1B_3B_5 is greater than or equal to 32\frac{3}{2}, it is sufficient to prove that the total area of the six triangles Ai+1BiAi+2A_{i+1}B_iA_{i+2} is at least 11:
i=05area Ai+1BiAi+21. \sum_{i=0}^{5} \text{area } A_{i+1}B_{i}A_{i+2} \geq 1.
To begin with, reflect each BiB_i through the midpoint of the segment Ai+1Ai+2A_{i+1}A_{i+2} to get the points BiB'_i. We shall prove that the six triangles Ai+1BiAi+2A_{i+1}B'_iA_{i+2} cover the hexagon. To this end, reflect A2i+1A_{2i+1} through the midpoint of the segment A2iA2i+2A_{2i}A_{2i+2} to get the points A2i+1A'_{2i+1}, i=0,1,2i=0,1,2. The hexagon splits into three parallelograms, A2iA2i+1A2i+2A2i+1A_{2i}A_{2i+1}A_{2i+2}A'_{2i+1}, i=0,1,2i=0,1,2, and a (possibly degenerate) triangle, A1A3A5A'_1A'_3A'_5. Notice first that each parallelogram A2iA2i+1A2i+2A2i+1A_{2i}A_{2i+1}A_{2i+2}A'_{2i+1} is covered by the pair of triangles (A2iB2i+5A2i+1,A2i+1B2iA2i+2)(A_{2i}B'_{2i+5}A_{2i+1}, A_{2i+1}B'_{2i}A_{2i+2}), i=0,1,2i=0,1,2. The proof is completed by showing that at least one of these pairs contains a triangle that covers the triangle A1A3A5A'_1A'_3A'_5. To this end, it is sufficient to prove that A2iB2i+5A2iA2i+5A_{2i}B'_{2i+5} \geq A_{2i}A'_{2i+5} and A2j+2B2jA2j+2A2j+3A_{2j+2}B'_{2j} \geq A_{2j+2}A'_{2j+3} for some indices i,j{0,1,2}i, j \in \{0,1,2\}. To establish the first inequality, notice that
A2iB2i+5=A2i+1B2i+5,A2iA2i+5=A2i+4A2i+5,i=0,1,2,A1B5A4A5=A0B5A5B3andA3B1A0A1=A2A3A0B5, A_{2i}B'_{2i+5} = A_{2i+1}B_{2i+5}, \quad A_{2i}A'_{2i+5} = A_{2i+4}A_{2i+5}, \quad i=0,1,2, \\ \frac{A_1B_5}{A_4A_5} = \frac{A_0B_5}{A_5B_3} \quad \text{and} \quad \frac{A_3B_1}{A_0A_1} = \frac{A_2A_3}{A_0B_5},
to get
i=02A2iB2i+5A2iA2i+5=1. \prod_{i=0}^{2} \frac{A_{2i}B'_{2i+5}}{A_{2i}A'_{2i+5}} = 1.
Similarly,
j=02A2j+2B2jA2j+2A2j+3=1, \prod_{j=0}^{2} \frac{A_{2j+2}B'_{2j}}{A_{2j+2}A'_{2j+3}} = 1,
whence the conclusion.

Figure 1

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.