Find the values of $n$ such that there exist a regular polygon with $n$ vertices such that can be partitioned with isosceles triangles with the vertices in the vertices of the polygon. The diagonals can't be intersected.
2026-03-25 04:36:06.1774413366
Partition of a regular polygon
81 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
Not sure if I misunderstand your question. Does it means 5 is a solution?