Maths Olympiad Prep

Library / /1 of 15

Geometry Difficulty 4.4 AIME Prove it United States

Problem:

Does there exist a convex polygon that can be partitioned into non-convex quadrilaterals?

Solution

Solution:

The answer is no. Assume that, on the contrary, it is possible to partition a polygon PP into non-convex quadrilaterals. Let nn be the number of quadrilaterals. Denote by SS the total sum of all internal angles of all the quadrilaterals. Since the sum of internal angles of each quadrilateral is 360360^{\circ}, we have S=360nS = 360^{\circ} n. However, each of the non-convex angles has to be in the interior of PP, hence the sum of angles around the vertex of that angle has to be 360360^{\circ}. This immediately gives 360n360^{\circ} n as the sum of angles around such vertices. Since those are not the only vertices (at least the vertices of PP will contribute to the sum SS), we have that S>360nS > 360^{\circ} n and this is a contradiction.

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.