We say that a diagonal of a convex pentagon is *good* if it divides the pentagon into a triangle and a circumscribed quadrilateral.
Find the greatest number of good diagonals in a convex pentagon. (I. Gorodnin)
Solution
Answer: 2.
Show that any two intersecting diagonals of the pentagon cannot be good at the same time. Suppose, contrary to our claim, that there are two good intersecting diagonals. Without loss of generality, we assume that and are good diagonals of the pentagon (see Fig. 1). Then and are circumscribed quadrilaterals, therefore the sums of their opposite sides are equal. Hence,
which gives
Let be the intersection point of and . Then, by the triangle inequality, we have
contrary to (1). Similarly, the crossing diagonals and of the pentagon cannot be good at the same time. Since there are no more than two noncrossing diagonals in the pentagon, the number of good diagonals in the pentagon is less than or equal to 2.

Рис. 1
Рис. 2
Show that there exist a pentagon with two good diagonals. We mark five points in the plain such that and (see Fig. 2). Then it is evident that the triangles are equal. Therefore, and . The constructed pentagon is convex since, by construction, , , . Two diagonals and are good since the quadrilaterals and are circumscribed quadrilaterals because and .