Olympiad Maths Prep

Track / Stage 6 / 161 of 400 #1161 of 2000

Problem 1161

National olympiad, first round
Geometry Difficulty 6.2 Prove it

4. Let C1,C2C_{1}, C_{2} be concentric circles, with the radius of C2C_{2} being λ(λ>1)\lambda(\lambda>1) times the radius of C1C_{1}. An nn-sided polygon A1A2AnA_{1} A_{2} \cdots A_{n} is inscribed in C1C_{1}, and the extensions of AnA1,A1A2,,An1AnA_{n} A_{1}, A_{1} A_{2}, \cdots, A_{n-1} A_{n} intersect circle C2C_{2} at B1,B2,BnB_{1}, B_{2}, \cdots B_{n}, respectively. If the perimeters of the nn-sided polygons A1A2AnA_{1} A_{2} \cdots A_{n} and B1B2BnB_{1} B_{2} \cdots B_{n} are p1p_{1} and p2p_{2}, respectively, prove that: p2λp1p_{2} \geqslant \lambda p_{1}, with equality if and only if the nn-sided polygon A1A2AnA_{1} A_{2} \cdots A_{n} is a regular nn-sided polygon.
(IMO - 21 Shortlist)

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

4. Let the center of circle C1C_{1} be OO, and the radius be rr. Connect OAi,OBi(i=1,2,,n)O A_{i}, O B_{i} (i=1,2, \cdots, n). Applying Ptolemy's inequality in quadrilateral OA1B1B2O A_{1} B_{1} B_{2}, we have OA1B1B2+OO2A1B1OB1A1B2O A_{1} \cdot B_{1} B_{2} + O O_{2} \cdot A_{1} B_{1} \geqslant O B_{1} \cdot A_{1} B_{2}, which means rB1B2+λrA1B1λr(A1A2+A2B2)r \cdot B_{1} B_{2} + \lambda r \cdot A_{1} B_{1} \geqslant \lambda r (A_{1} A_{2} + A_{2} B_{2}), hence
B1B2+λA1B1λ(A1A2+A2B2). B_{1} B_{2} + \lambda A_{1} B_{1} \geqslant \lambda (A_{1} A_{2} + A_{2} B_{2}).

Similarly, applying Ptolemy's inequality iteratively, we have B2B3+λA2B2λ(A2A3+A3B3)B_{2} B_{3} + \lambda' A_{2} B_{2} \geqslant \lambda (A_{2} A_{3} + A_{3} B_{3}); B3B4+λA3B3λ(A3A4+A4B4)B_{3} B_{4} + \lambda \cdot A_{3} B_{3} \geqslant \lambda (A_{3} A_{4} + A_{4} B_{4}); \cdots; Bn1Bn+λAn1Bn1λ(An1An+AnBn)B_{n-1} B_{n} + \lambda \cdot A_{n-1} B_{n-1} \geqslant \lambda (A_{n-1} A_{n} + A_{n} B_{n}); BnB1+λAnBnλ(AnA1+A1B1)B_{n} B_{1} + \lambda A_{n} B_{n} \geqslant \lambda (A_{n} A_{1} + A_{1} B_{1}).

Adding these inequalities, we get B1B2+B2B3++Bn1Bn+BnB1λ(A1A2+A2A3++An1An+AnA1)B_{1} B_{2} + B_{2} B_{3} + \cdots + B_{n-1} B_{n} + B_{n} B_{1} \geqslant \lambda (A_{1} A_{2} + A_{2} A_{3} + \cdots + A_{n-1} A_{n} + A_{n} A_{1}), hence p2λp1p_{2} \geqslant \lambda p_{1}. The equality in Ptolemy's inequality holds if and only if the quadrilaterals OA1B1B2O A_{1} B_{1} B_{2}, OA2B2B3O A_{2} B_{2} B_{3}, \cdots, OAnBnB1O A_{n} B_{n} B_{1} are all cyclic quadrilaterals. By the properties of cyclic quadrilaterals, we know OA2A3=OB2B3\angle O A_{2} A_{3} = \angle O B_{2} B_{3}, OA2A1=OB3B2\angle O A_{2} A_{1} = \angle O B_{3} B_{2}, but OB2B3=OB3O2\angle O B_{2} B_{3} = \angle O B_{3} O_{2}, thus OA2A1=OA2A3\angle O A_{2} A_{1} = \angle O A_{2} A_{3}, so OA1A2OA2A3\triangle O A_{1} A_{2} \cong \triangle O A_{2} A_{3}, therefore, A1A2=A2A3A_{1} A_{2} = A_{2} A_{3}. Similarly, A2A3=A3A4==AnA1A_{2} A_{3} = A_{3} A_{4} = \cdots = A_{n} A_{1}, which means the nn-sided polygon A1A2AnA_{1} A_{2} \cdots A_{n} is a regular nn-sided polygon.

Conversely, if A1A2AnA_{1} A_{2} \cdots A_{n} is a regular nn-sided polygon, rotating it counterclockwise around point OO by 2πn\frac{2 \pi}{n}, we have A1A2A_{1} \rightarrow A_{2}, A2A3A_{2} \rightarrow A_{3}, \cdots, AnA1A_{n} \rightarrow A_{1}, thus B1B2B_{1} \rightarrow B_{2}, B2B3B_{2} \rightarrow B_{3}, \cdots, BnB1B_{n} \rightarrow B_{1}. Therefore, B1B2BnB_{1} B_{2} \cdots B_{n} is also a regular nn-sided polygon, so A1A2=A2A3==AnA1=2rsinπnA_{1} A_{2} = A_{2} A_{3} = \cdots = A_{n} A_{1} = 2 r \cdot \sin \frac{\pi}{n}, B1B2=B2B3==BnB1=2λrsinπnB_{1} B_{2} = B_{2} B_{3} = \cdots = B_{n} B_{1} = 2 \lambda r \cdot \sin \frac{\pi}{n}. At this point, we have p2=λp1p_{2} = \lambda p_{1}.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.