Maths Olympiad Prep

Library / /354 of 383

, 2021

Geometry Difficulty 9.0 IMO level Prove it IMO

Determine all integers n3n \geqslant 3 satisfying the following property: every convex nn-gon whose sides all have length 11 contains an equilateral triangle of side length 11.
(Every polygon is assumed to contain its boundary.)

Solution

Answer: All odd n3n \geqslant 3.

First we show that for every even n4n \geqslant 4 there exists a polygon violating the required statement. Consider a regular kk-gon A0A1,Ak1A_{0} A_{1}, \ldots A_{k-1} with side length 11. Let B1,B2,,Bn/21B_{1}, B_{2}, \ldots, B_{n / 2-1} be the points symmetric to A1,A2,,An/21A_{1}, A_{2}, \ldots, A_{n / 2-1} with respect to the line A0An/2A_{0} A_{n / 2}. Then P=A0A1A2An/21An/2Bn/21Bn/22B2B1P= A_{0} A_{1} A_{2} \ldots A_{n / 2-1} A_{n / 2} B_{n / 2-1} B_{n / 2-2} \ldots B_{2} B_{1} is a convex nn-gon whose sides all have length 11. If kk is big enough, PP is contained in a strip of width 1/21 / 2, which clearly does not contain any equilateral triangle of side length 11.

Figure 1

Assume now that n=2k+1n=2k+1. As the case k=1k=1 is trivially true, we assume k2k \geqslant 2 henceforth. Consider a convex (2k+1)(2k+1)-gon PP whose sides all have length 11. Let dd be its longest diagonal. The endpoints of dd split the perimeter of PP into two polylines, one of which has length at least k+1k+1. Hence we can label the vertices of PP so that P=A0A1A2kP=A_{0} A_{1} \ldots A_{2k} and d=A0Ad=A_{0} A_{\ell} with k+1\ell \geqslant k+1. We will show that, in fact, the polygon A0A1AA_{0} A_{1} \ldots A_{\ell} contains an equilateral triangle of side length 11.

Suppose that AA0A160\angle A_{\ell} A_{0} A_{1} \geqslant 60^{\circ}. Since dd is the longest diagonal, we have A1AA0AA_{1} A_{\ell} \leqslant A_{0} A_{\ell}, so A0A1AAA0A160\angle A_{0} A_{1} A_{\ell} \geqslant \angle A_{\ell} A_{0} A_{1} \geqslant 60^{\circ}. It follows that there exists a point XX inside the triangle A0A1AA_{0} A_{1} A_{\ell} such that the triangle A0A1XA_{0} A_{1} X is equilateral, and this triangle is contained in PP. Similar arguments apply if A1AA060\angle A_{\ell-1} A_{\ell} A_{0} \geqslant 60^{\circ}.

Figure 2

From now on, assume AA0A1<60\angle A_{\ell} A_{0} A_{1}<60^{\circ} and A1AA0<60A_{\ell-1} A_{\ell} A_{0}<60^{\circ}.
Consider an isosceles trapezoid A0YZAA_{0} Y Z A_{\ell} such that A0AYZA_{0} A_{\ell} \parallel Y Z, A0Y=ZA=1A_{0} Y=Z A_{\ell}=1, and AA0Y=ZAA0=60\angle A_{\ell} A_{0} Y=\angle Z A_{\ell} A_{0}=60^{\circ}. Suppose that A0A1AA_{0} A_{1} \ldots A_{\ell} is contained in A0YZAA_{0} Y Z A_{\ell}. Note that the perimeter of A0A1AA_{0} A_{1} \ldots A_{\ell} equals +A0A\ell+A_{0} A_{\ell} and the perimeter of A0YZAA_{0} Y Z A_{\ell} equals 2A0A+12 A_{0} A_{\ell}+1.

Figure 3

Recall a well-known fact stating that if a convex polygon P1P_{1} is contained in a convex polygon P2P_{2}, then the perimeter of P1P_{1} is at most the perimeter of P2P_{2}. Hence we obtain
+A0A2A0A+1, i.e. 1A0A. \ell+A_{0} A_{\ell} \leqslant 2 A_{0} A_{\ell}+1, \quad \text{ i.e. } \quad \ell-1 \leqslant A_{0} A_{\ell} .
On the other hand, the triangle inequality yields
A0A<AA+1+A+1A+2++A2kA0=2k+11, A_{0} A_{\ell}<A_{\ell} A_{\ell+1}+A_{\ell+1} A_{\ell+2}+\ldots+A_{2k} A_{0}=2k+1-\ell \leqslant \ell-1,
which gives a contradiction.

Therefore, there exists a vertex AmA_{m} of A0A1AA_{0} A_{1} \ldots A_{\ell} which lies outside A0YZAA_{0} Y Z A_{\ell}. Since
AA0A1<60=AA0Y and A1AA0<60=ZAA0, \begin{equation*} \angle A_{\ell} A_{0} A_{1}<60^{\circ}=\angle A_{\ell} A_{0} Y \quad \text{ and } \quad A_{\ell-1} A_{\ell} A_{0}<60^{\circ}=\angle Z A_{\ell} A_{0}, \tag{1} \end{equation*}
the distance between AmA_{m} and A0AA_{0} A_{\ell} is at least 3/2\sqrt{3} / 2.
Let PP be the projection of AmA_{m} to A0AA_{0} A_{\ell}. Then PAm3/2P A_{m} \geqslant \sqrt{3} / 2, and by (1) we have A0P>1/2A_{0} P>1 / 2 and PA>1/2P A_{\ell}>1 / 2. Choose points QA0PQ \in A_{0} P, RPAR \in P A_{\ell}, and SPAmS \in P A_{m} such that PQ=PR=1/2P Q=P R=1 / 2 and PS=3/2P S=\sqrt{3} / 2. Then QRSQ R S is an equilateral triangle of side length 11 contained in A0A1AA_{0} A_{1} \ldots A_{\ell}.

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.