RMM P4 - playing around with figures
Source: RMM 2019 P4
February 24, 2019
combinatorial geometrycombinatorics
Problem Statement
Prove that for every positive integer there exists a (not necessarily convex) polygon with no three collinear vertices, which admits exactly diffferent triangulations.(A triangulation is a dissection of the polygon into triangles by interior diagonals which have no common interior points with each other nor with the sides of the polygon)