Maths Olympiad Prep

Library / /11 of 13

Geometry Difficulty 7.2 National olympiad, round 2 Find the answer

The area of a convex pentagon ABCDEA B C D E is SS, and the circumradii of the triangles ABC,BCD,CDE,DEA,EABA B C, B C D, C D E, D E A, E A B are R1,R2,R3,R4,R5R_{1}, R_{2}, R_{3}, R_{4}, R_{5}. Prove the inequality R14+R24+R34+R44+R5445sin2108S2R_{1}^{4}+R_{2}^{4}+R_{3}^{4}+R_{4}^{4}+R_{5}^{4} \geqslant \frac{4}{5 \sin ^{2} 108^{\circ}} S^{2}.

A number or a short expression. Spacing and $ signs are ignored.

Solution

First we prove the following Lemma 1. In a convex nn-gon A1A2AnA_{1} A_{2} \ldots A_{n} with area SS we have 4SAnA2R1+A1A3R2++An1A1Rn4 S \leqslant A_{n} A_{2} \cdot R_{1}+A_{1} A_{3} \cdot R_{2}+\ldots+A_{n-1} A_{1} \cdot R_{n} where RiR_{i} is the circumradius of the triangle Ai1AiAi+1,A0=An,An+1=AnA_{i-1} A_{i} A_{i+1}, A_{0}=A_{n}, A_{n+1}=A_{n}. Let MiM_{i} be the midpoint of AiAi+1A_{i} A_{i+1} for i=1,,ni=1, \ldots, n. For each ii we consider the quadrilateral formed by the segments AiMiA_{i} M_{i} and AiMi1A_{i} M_{i-1} and the perpendiculars to this segments drawn through MiM_{i} and Mi1M_{i-1}, respectively. We claim that these nn quadrilateral cover the nn-gon. Indeed, let PP be a point inside the nn-gon. Let PAkP A_{k} be the minimum among the distances PA1,PA2,,PAnP A_{1}, P A_{2}, \ldots, P A_{n}. We have PAkPAk+1P A_{k} \leqslant P A_{k+1} and PAkPAk11P A_{k} \leqslant P A_{k-11}, therefore PP belongs to the nn-gon and to each of the two half-planes containing AkA_{k} and bounded by the perpendicular bisectors to AkAk+1A_{k} A_{k+1} and AkAk11A_{k} A_{k-11}, that is, to the kk-th quadrilateral. To complete the proof it remains to note that the area of the ii-th quadrilateral does nor exceed 12Ai1Ai+12Ri\frac{1}{2} \cdot \frac{A_{i-1} A_{i+1}}{2} \cdot R_{i}. For our problem it follows that 4S2R12sinA1+2R22sinA2++2R52sinA54 S \leqslant 2 R_{1}^{2} \sin \angle A_{1}+2 R_{2}^{2} \sin \angle A_{2}+\ldots+2 R_{5}^{2} \sin \angle A_{5}. Applying Cauchy-Buniakowsky inequality, we obtain 2SR12sinA1+R22sinA2++R52sinA5(R14++R54)(sin2A1++sin2A5)5(R14++R54)sin21082 S \leqslant R_{1}^{2} \sin \angle A_{1}+R_{2}^{2} \sin \angle A_{2}+\ldots+R_{5}^{2} \sin \angle A_{5} \leqslant \sqrt{\left(R_{1}^{4}+\ldots+R_{5}^{4}\right)\left(\sin ^{2} \angle A_{1}+\ldots+\sin ^{2} \angle A_{5}\right)} \leqslant \sqrt{5\left(R_{1}^{4}+\ldots+R_{5}^{4}\right) \sin ^{2} 108^{\circ}} thus 4S25sin2108R14+R24++R54\frac{4 S^{2}}{5 \sin ^{2} 108^{\circ}} \leqslant R_{1}^{4}+R_{2}^{4}+\ldots+R_{5}^{4}. In the above inequality we made use of the following Lemma 2. If α1,α2,,α5\alpha_{1}, \alpha_{2}, \ldots, \alpha_{5} are angles of a convex pentagon, then sin2α1++sin2α55sin2108\sin ^{2} \alpha_{1}+\ldots+\sin ^{2} \alpha_{5} \leqslant 5 \sin ^{2} 108^{\circ}. The sum in question does not depend on the order of the angles, therefore we may assume α1α2α5\alpha_{1} \leqslant \alpha_{2} \leqslant \ldots \leqslant \alpha_{5}. If α1=108\alpha_{1}=108^{\circ}, then α2==α5=108\alpha_{2}=\ldots=\alpha_{5}=108^{\circ}, and the inequality turns to equality. If α1<108\alpha_{1}<108^{\circ}, then α5>108\alpha_{5}>108^{\circ}. Note that α1+α5<270\alpha_{1}+\alpha_{5}<270^{\circ} (if α1+α5270\alpha_{1}+\alpha_{5} \geqslant 270^{\circ}, then α2+α3+α4270\alpha_{2}+\alpha_{3}+\alpha_{4} \leqslant 270^{\circ}, therefore α290\alpha_{2} \leqslant 90^{\circ}, a fortiori α190\alpha_{1} \leqslant 90^{\circ} and thus α5180\alpha_{5} \geqslant 180^{\circ}, a contradiction). Then we have sin2108+sin2(α1+α5108)sin2α1sin2α5=2cos(α1+α5)sin(α1108)sin(α5108)>0\sin ^{2} 108^{\circ}+\sin ^{2}\left(\alpha_{1}+\alpha_{5}-108^{\circ}\right)-\sin ^{2} \alpha_{1}-\sin ^{2} \alpha_{5}=2 \cos \left(\alpha_{1}+\alpha_{5}\right) \sin \left(\alpha_{1}-108^{\circ}\right) \sin \left(\alpha_{5}-108^{\circ}\right)>0. It means that changing the angles α1\alpha_{1} by 108108^{\circ} and α5\alpha_{5} by α1+α5108\alpha_{1}+\alpha_{5}-108^{\circ} increases the sum of squares of the sines. Iterating this operation, we shall make all the angles equal to 108108^{\circ}, thus proving the inequality.

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: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.