CN-TST 2023 Problem 5
Let be a triangle, and let be points inside where no three given points are collinear. Prove that we can partition into triangles such that their vertices are among , and at least of them contain at least one 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.