How many non-overlapping triangles can we make in a n-gon (polygon having n sides), by joining the vertices?
There can be n-1 lines that can be drawn from one vertices. Out of these 2 sides are adjacent sides so n-3 lines can be drawn. When a n-gon is divided by n-3 lines the n-gon is divided into n-2 triangles.
Couldn't generate an explanation.
Generated by AI. May contain inaccuracies — always verify with your textbook.