Problem

Source:

Tags: combinatorics, geometry



Regular $n$-gon is divided to triangles using $n-3$ 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