RS-SMO 2014 Problem 5
Regular -gon is divided to triangles using diagonals of which none of them have common points with another inside polygon. How much among this triangles can there be the most not congruent?
Proposed by Dusan Djukic
Dataset text AI-MO AoPS. Quoted with source.
Official text: Serbian Mathematical Olympiad 2014 official paper, page 2.
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.