MathNet 2010 — Part 02 Question 119

Let $n \geq 3$ be a convex $n$ corner $P$. Prove that $P$ can be disassembled into triangles with the help of $n-3$, so that the circumference of each of these triangles contains quite $P$. When exactly does such a disassembly exist?