For a regular polygon with $n$ sides $(n>5)$, the number of triangles whose vertices are joining non-adjacent vertices of the polygon is $n(n-4)(n-5)$.
When I take $n=6$, I get David's Star:

So, only two triangles! How can I get $n(n-4)(n-5)$?
For a regular polygon with $n$ sides $(n>5)$, the number of triangles whose vertices are joining non-adjacent vertices of the polygon is $n(n-4)(n-5)$.
When I take $n=6$, I get David's Star:

So, only two triangles! How can I get $n(n-4)(n-5)$?
Copyright © 2021 JogjaFile Inc.