Pascal wants to find the sum of the measures of the interior angles of a polygon that has n sides. how could he do this?

Answer with explanation:

Smallest Polygon = Triangle , which has 3 sides

Sum of angles of triangle = 180°→→, Using the angle sum property of triangle.

We can find the Sum of angles of triangle, using the formula

   = (n-2)×180°

  = (3-2)×180°

 = 1 × 180°

 = 180°

A Quadrilateral has four sides.

Sum of angles of Quadrilateral = 360°

Or , using the formula

=(4-2)×180°

=2 × 180°

=360°

For, n sided Polygon

Sum of it's Interior angles = (n-2) × 180°

To prove this, we should divide that polygon into triangles, and multiply number of triangles by angle of 180°.

For, example, Quadrilateral can be divided into two triangles , sum of interior angles of Quadrilateral =2 × 180°=360°

if this is really you s much. i only have 3 points left and i have 2 questions to ask

no this is a nonlinear negative