Maths Olympiad Prep

Library / /249 of 397

, 2022

Geometry Difficulty 6.2 National Olympiad Prove it Taiwan

Determine all positive integers n3n \ge 3 satisfying the following property: for every convex nn-gon each of whose sides has length 1, one can place an equilateral triangle of side length 1 inside the region it encloses.

(Note: the region enclosed by a convex polygon refers to its interior together with its boundary.)

Solution

All odd n3n \ge 3.

First we show that for every even n4n \ge 4 there exists an nn-polygon violating the required statement. Consider a regular kk-gon A0A1...Ak1A_0A_1...A_{k-1} with side length 1. Let B1,B2,...,Bn/21B_1, B_2, ..., B_{n/2-1} be the points symmetric to A1,A2,...,An/21A_1, A_2, ..., A_{n/2-1} with respect to the line A0An/2A_0A_{n/2}. Then P=A0A1A2...An/21An/2Bn/21Bn/22...B2B1\mathcal{P} = A_0A_1A_2...A_{n/2-1}A_{n/2}B_{n/2-1}B_{n/2-2}...B_2B_1 is a convex nn-gon whose sides all have length 1. If kk is big enough, P\mathcal{P} is contained in a strip of width 1/21/2, which clearly does not contain any equilateral triangle of side length 1.

Figure 1

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

Suppose that AA0A160\angle A_\ell A_0 A_1 \ge 60^\circ. Since dd is the longest diagonal, we have A1AA0AA_1 A_\ell \le A_0 A_\ell, so A0A1AAA0A160\angle A_0 A_1 A_\ell \ge \angle A_\ell A_0 A_1 \ge 60^\circ. It follows that there exists a point XX inside the triangle A0A1AA_0A_1A_\ell such that the triangle A0A1XA_0A_1X is equilateral, and this triangle is contained in P\mathcal{P}. Similar arguments apply if A1AA060\angle A_{\ell-1} A_\ell A_0 \ge 60^\circ.

From now on, assume AA0A1<60\angle A_\ell A_0 A_1 < 60^\circ and A1AA0<60\angle A_{\ell-1} A_\ell A_0 < 60^\circ.

Consider an isocles trapezoid A0YZAA_0YZA_\ell such that A0AYZA_0A_\ell \parallel YZ, A0Y=ZA=1A_0Y = ZA_\ell = 1, and AA0Y=ZAA0=60\angle A_\ell A_0Y = \angle ZA_\ell A_0 = 60^\circ. Suppose that A0A1AA_0A_1 \dots A_\ell is contained in A0YZAA_0YZA_\ell. Note that the perimeter of A0A1AA_0A_1 \dots A_\ell equals +A0A\ell + A_0A_\ell and the perimeter of A0YZAA_0YZA_\ell equals 2A0A+12A_0A_\ell + 1.

Figure 2

Recall a well-known fact stating that if a convex polygon P1\mathcal{P}_1 is contained in a convex polygon P2\mathcal{P}_2, then the perimeter of P1\mathcal{P}_1 is at most the perimeter of P2\mathcal{P}_2. Hence we obtain
+A0A2A0A+1, i.e. 1A0A. \ell + A_0 A_\ell \le 2A_0 A_\ell + 1, \quad \text{ i.e. } \ell - 1 \le 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} + \dots + A_{2k} A_0 = 2k + 1 - \ell \le \ell - 1.
which gives a contradiction.

Therefore, there exists a vertex AmA_m of A0A1AA_0A_1 \dots A_\ell which lies outside A0YZAA_0YZA_\ell. Since
AA0A1<60=AA0YandA1AA0<60=ZAA0,(1) \angle A_\ell A_0 A_1 < 60^\circ = \angle A_\ell A_0 Y \quad \text{and} \quad \angle A_{\ell-1} A_\ell A_0 < 60^\circ = \angle Z A_\ell A_0, \qquad (1)
the distance between AmA_m and A0AA_0A_\ell is at least 3/2\sqrt{3}/2.

Let PP be the projection of AmA_m to A0AA_0A_\ell. Then PAm3/2PA_m \ge \sqrt{3}/2, and by (1) we have A0P>1/2A_0P > 1/2 and PA>1/2PA_\ell > 1/2. Choose points QA0PQ \in A_0P, RPAR \in PA_\ell, and SPAmS \in PA_m such that PQ=PR=1/2PQ = PR = 1/2 and PS=3/2PS = \sqrt{3}/2. Then QRSQRS is an equilateral triangle of side length 1 contained in A0A1AA_0A_1 \dots 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 translated into English from zh; metadata (topic, difficulty) added by this project.