Miklós Schweitzer 1956- Problem 3
Source:
October 9, 2015
college contests
Problem Statement
3. A triangulation of a convex closed polygon is the division into triangles of this poilygon by diagonals not intersecting in the interior of the polygon. Find the number of all triangulations fo a conves n-gon and also the number of those triangulations in which every triangle has at least one side in common with the given n-gon. (C. 4)