RMM 2019 Problem 4
- Day 2
Prove that for every positive integer there exists a (not necessarily convex) polygon with no three collinear vertices, which admits exactly different 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.)
Dataset text NuminaMath olympiads. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.