As the title suggests today I solved a geometry problem and when I finished I had this question
For which integers $n ≥ 3$ can one find a polygon triangulation of regular $n$-gon consisting only of isosceles triangles?
My idea was analize when $n$ is even and try to find an algorithm, then do te same with $n$ odd, but I don't know how to proceed. Another approach was using graphs, but I think is even more complicated.
Any idea or suggestion? Thanks in advance.