MathDB
SMO 2014

Source:

May 22, 2015
combinatoricsgeometry

Problem Statement

Regular nn-gon is divided to triangles using nāˆ’3n-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