Maths Olympiad Prep

Library /

Geometry Difficulty 7.5 National Olympiad, round 2 Prove it Zhautykov Olympiad

Problem:

The area of a convex pentagon ABCDEABCDE is SS, and the circumradii of the triangles ABCABC, BCDBCD, CDECDE, DEADEA, EABEAB are R1R_{1}, R2R_{2}, R3R_{3}, R4R_{4}, R5R_{5}. Prove the inequality
R14+R24+R34+R44+R5445sin2108S2 R_{1}^{4} + R_{2}^{4} + R_{3}^{4} + R_{4}^{4} + R_{5}^{4} \geq \frac{4}{5 \sin^{2} 108^{\circ}} S^{2}

Solution

Solution:

Lemma 1. The area SS of a convex nn-gon A1A2AnA_{1}A_{2}\ldots A_{n} satisfies
2S12i=1nAi1Ai+1Ri=i=1nRi2sinAi 2S \leq \frac{1}{2} \sum_{i=1}^{n} A_{i-1}A_{i+1} \cdot R_{i} = \sum_{i=1}^{n} R_{i}^{2} \sin A_{i}
where RiR_{i} is the radius of the circumcircle of Ai1AiAi+1\triangle A_{i-1}A_{i}A_{i+1}, and the indices are reduced modulo nn (thus A0AnA_{0} \equiv A_{n} and An+1A1A_{n+1} \equiv A_{1}).

Proof. Let MiM_{i} be the midpoint of AiAi+1A_{i}A_{i+1}, for 1in1 \leq i \leq n. For each ii consider the quadrilateral formed by the segments AiMiA_{i}M_{i} and AiMi1A_{i}M_{i-1}, and by the perpendiculars onto these segments at MiM_{i} and Mi1M_{i-1}, respectively.
We shall prove that these nn quadrilaterals cover our nn-gon. Indeed, let PP be a point inside the nn-gon. Let PAkPA_{k} be the least of the distances PAiPA_{i}, 1in1 \leq i \leq n. Having PAkPAk+1PA_{k} \leq PA_{k+1} and PAkPAk1PA_{k} \leq PA_{k-1} means PP lies inside the nn-gon and in each of the two half-planes containing AkA_{k} and limited by the perpendicular bisectors of AkAk+1A_{k}A_{k+1} and AkAk1A_{k}A_{k-1}, thus in the kk-th quadrilateral. To complete the proof, it remains to notice that the area of the ii-th quadrilateral does not exceed Ai1Ai+12Ri2\frac{A_{i-1}A_{i+1}}{2} \cdot \frac{R_{i}}{2}, and also that of course Ai1Ai+12=RisinAi\frac{A_{i-1}A_{i+1}}{2} = R_{i} \sin A_{i}.

Lemma 2. If α1,α2,,α5\alpha_{1}, \alpha_{2}, \ldots, \alpha_{5} are the angles of a convex pentagon, then sin2α1+sin2α2++sin2α55sin2108\sin^{2} \alpha_{1} + \sin^{2} \alpha_{2} + \cdots + \sin^{2} \alpha_{5} \leq 5 \sin^{2} 108^{\circ}.

Proof. Will be presented at the end.

In the context of our problem, it follows that 2Si=15Ri2sinAi2S \leq \sum_{i=1}^{5} R_{i}^{2} \sin A_{i}. Using the Cauchy-Schwarz-Bunyakovsky inequality and Lemma 2 we now obtain
2Si=15Ri2sinAi(i=15Ri4)(i=15sin2Ai)5sin2108i=15Ri4 2S \leq \sum_{i=1}^{5} R_{i}^{2} \sin A_{i} \leq \sqrt{\left(\sum_{i=1}^{5} R_{i}^{4}\right)\left(\sum_{i=1}^{5} \sin^{2} A_{i}\right)} \leq \sqrt{5 \sin^{2} 108^{\circ} \sum_{i=1}^{5} R_{i}^{4}}
whence 4S25sin2108i=15Ri4\frac{4S^{2}}{5 \sin^{2} 108^{\circ}} \leq \sum_{i=1}^{5} R_{i}^{4}.

Proof of Lemma 2. We may assume 0<α1α2α5<1800 < \alpha_{1} \leq \alpha_{2} \leq \cdots \leq \alpha_{5} < 180^{\circ}. By a well-known formula α1+α2++α5=540\alpha_{1} + \alpha_{2} + \cdots + \alpha_{5} = 540^{\circ}. If α1=108\alpha_{1} = 108^{\circ}, then α2==α5=108\alpha_{2} = \cdots = \alpha_{5} = 108^{\circ}, and the inequality becomes equality. If α1<108\alpha_{1} < 108^{\circ}, then α5>108\alpha_{5} > 108^{\circ}. Notice that α1+α5<270\alpha_{1} + \alpha_{5} < 270^{\circ} (if α1+α5270\alpha_{1} + \alpha_{5} \geq 270^{\circ}, then α2+α3+α4270\alpha_{2} + \alpha_{3} + \alpha_{4} \leq 270^{\circ}, so α290\alpha_{2} \leq 90^{\circ}, a fortiori α190\alpha_{1} \leq 90^{\circ}, and therefore α5180\alpha_{5} \geq 180^{\circ}, a contradiction).

Therefore we arrive at
sin2108+sin2(α1+α5108)sin2α1sin2α5=2cos(α1+α5)sin(α1108)sin(α5108)>0. \sin^{2} 108^{\circ} + \sin^{2}(\alpha_{1} + \alpha_{5} - 108^{\circ}) - \sin^{2} \alpha_{1} - \sin^{2} \alpha_{5} = 2 \cos(\alpha_{1} + \alpha_{5}) \sin(\alpha_{1} - 108^{\circ}) \sin(\alpha_{5} - 108^{\circ}) > 0.
This means that by the replacement of α1\alpha_{1} with 108108^{\circ} and of α5\alpha_{5} with α1+α5108\alpha_{1} + \alpha_{5} - 108^{\circ} we increase the sum of the squared sinuses. Repeating this operation, we will make all the angles equal to 108108^{\circ}, and the inequality is proved.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.