Problem

Source: IGO 2024 Elementary Level - Problem 4

Tags: geometry, combinatorial geometry



An inscribed $n$-gon ($n > 3$), is divided into $n-2$ triangles by diagonals which meet only in vertices. What is the maximum possible number of congruent triangles obtained? (An inscribed $n$-gon is an $n$-gon where all its vertices lie on a circle) Proposed by Boris Frenkin - Russia