Problem:
Does there exist a convex polygon that can be partitioned into non-convex quadrilaterals?
Problem:
Does there exist a convex polygon that can be partitioned into non-convex quadrilaterals?
Solution:
The answer is no. Assume that, on the contrary, it is possible to partition a polygon into non-convex quadrilaterals. Let be the number of quadrilaterals. Denote by the total sum of all internal angles of all the quadrilaterals. Since the sum of internal angles of each quadrilateral is , we have . However, each of the non-convex angles has to be in the interior of , hence the sum of angles around the vertex of that angle has to be . This immediately gives as the sum of angles around such vertices. Since those are not the only vertices (at least the vertices of will contribute to the sum ), we have that and this is a contradiction.