Maths Olympiad Prep

Library / /20 of 31

Geometry Difficulty 5.6 AIME, harder Prove it Estonia

Find all possibilities: how many acute angles can there be in a convex polygon?

Solution

A square has 0 acute angles, a right-angled trapezium has 1 acute angle, an obtuse triangle has 2 acute angles, an acute triangle has 3.

Figure 1
Fig. 1
Figure 2
Fig. 2
Figure 3
Fig. 3
Let us show that 4 or more acute angles is not possible. By moving along the boundary of the convex polygon, we turn at vertices in only one direction (for example left), and on arrival at the initial vertex we have turned a total of 360360^\circ. In an acute-angled vertex the direction changes by more than 9090^\circ (the change of direction equals the size of the respective exterior angle which is obtuse in this case). Thus if in the polygon there were 4 or more acute angles, the total turn in only those would be more than 360360^\circ.

Solution 2:
In a regular pentagon all angles have size 31805\frac{3 \cdot 180^\circ}{5} or 108108^\circ, thus there are 0 acute angles. By prolonging two sides in one direction, the angle of the pentagon at the moving vertex is reduced. As the angle between the extensions of two non-neighbouring sides is 1802(180108)180^\circ - 2 \cdot (180^\circ - 108^\circ), which equals 3636^\circ, the receding angle can be given size 6060^\circ without losing the convexity of the polygon (Fig. 1). By prolonging the already prolonged side in the other direction, we can similarly create another acute angle of size 6060^\circ (Fig. 2). Finally let us move the opposite vertex of the prolonged side away from that side. This can be done without losing convexity until there is an acute angle also at that vertex (Fig. 3). Indeed, as in this process the unchanging angles have size 6060^\circ, totalling 120120^\circ, the convexity of the pentagon is lost only when the size of the reducing angle reaches 6060^\circ, when the pentagon becomes a regular triangle.
On the other hand, when xx angles of a convex nn-gon are acute, then the sum of their sizes is less than x90x \cdot 90^\circ and the sum of the sizes of the other angles is less than (nx)180(n-x) \cdot 180^\circ. But the sum of the sizes of the interior angles of any nn-gon is (n2)180(n-2) \cdot 180^\circ. Therefore we get (n2)180<x90+(nx)180(n-2) \cdot 180^\circ < x \cdot 90^\circ + (n-x) \cdot 180^\circ, whence x90<2180x \cdot 90^\circ < 2 \cdot 180^\circ and x<4x < 4. Thus there can only be 0 to 3 acute angles in a convex nn-gon.

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 and solution reproduced as published; topic and difficulty added by this site.