Problem

Source:

Tags: combinatorics unsolved, combinatorics



In how many ways, can we draw $n-3$ diagonals of a $n$-gon with equal sides and equal angles such that: $i)$ none of them intersect each other in the polygonal. $ii)$ each of the produced triangles has at least one common side with the polygonal.