Maths Olympiad Prep

Library / /22 of 87

Geometry Difficulty 5.8 AIME, harder Prove it Serbia

A regular nn-gon is divided into triangles using n3n-3 diagonals, no two of which have a common interior point. What is the maximum number among these triangles that can be pairwise non-congruent?
(Dušan Đukić)

Solution

Solution:

The answer is [3n74]\left[\frac{3 n-7}{4}\right] for n>3n>3, that is, 1 for n=3n=3.

Triangles with two, one, or none of their sides being also a side of the nn-gon (n>3n>3) we call, in order, ears, thin, and thick triangles. Let there be aa thick triangles, bb thin ones, and cc ears in the division. The number of sides of the nn-gon that they occupy is b+2c=nb+2c=n. On the other hand, the total number of triangles is a+b+c=n2a+b+c=n-2. From these two relations we obtain c=a+2c=a+2.

Since there are at most [n12]\left[\frac{n-1}{2}\right] distinct triangles that are not thick, the total number NN of non-congruent triangles in the division is no greater than n12+a\frac{n-1}{2}+a. On the other hand, in such a division there are a+2a+2 ears, and all ears are congruent, so Nn2(a+1)=na3N \leqslant n-2-(a+1)=n-a-3. Adding these gives 2N(n12+a)+(na3)=3n722N \leqslant \left(\frac{n-1}{2}+a\right)+(n-a-3)=\frac{3n-7}{2}, i.e. N[3n74]N \leqslant \left[\frac{3n-7}{4}\right].

Finally, by drawing the diagonals A0A2iA_{0}A_{2i} and A2i2A2i(1i[n4])A_{2i-2}A_{2i}\left(1 \leqslant i \leqslant \left[\frac{n}{4}\right]\right) and A0AjA_{0}A_{j} (2[n4]<jn2)\left(2\left[\frac{n}{4}\right]<j \leqslant n-2\right) we obtain an example with exactly [n12]+[n4]1=[3n74]\left[\frac{n-1}{2}\right]+\left[\frac{n}{4}\right]-1=\left[\frac{3n-7}{4}\right] non-congruent triangles.

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