Ask Question
16 June, 16:47

Write a proof of the Polygon Interior Angle-Sum Theorem.

The sum of the measures of the interior angles of a convex n-gon is 180 times (n-2).

By drawing every diagonal from one vertex in a convex, n-sided polygon, the polygon can be decomposed into how many triangles?

+5
Answers (1)
  1. 16 June, 19:21
    0
    You can always decompose a polygon into n-2 triangles, of which each is a triangle. The sum of the angles in a triangle is 180, so you get the formula 180 (n-2).

    The n-sided polygon can always be decomposed into n-2 triangles.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “Write a proof of the Polygon Interior Angle-Sum Theorem. The sum of the measures of the interior angles of a convex n-gon is 180 times ...” in 📘 Mathematics if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers