CH-SMO 2010 Problem 10
Let and a convex -gon. Show that can be, by non-intersecting diagonals, partitioned in triangles such that the circumcircle of each triangle contains the whole area of . Under which conditions is there exactly one such triangulation?
Dataset text AI-MO AoPS. 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.