KURSCHAK 1967 Problem 2
A convex -gon is divided into triangles by diagonals which do not intersect except at vertices of the n-gon. Each vertex belongs to an odd number of triangles. Show that must be a multiple of .
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.