A convex polygon with *n* sides can be dissected (triangulated)
into triangles by drawing a certain number of non-crossing diagonals.

- How many diagonals are needed?
- How many triangles result?
- A triangle in the triangulation consisting of two consecutive edges of the boundary together with one internal diagonal is called an ear of the triangulation. Prove that if then every triangulation has at least two ears.

Wed Apr 21 08:26:07 EDT 1999