Pic related is a typical high school geometry exercise to discover the sum of the interior angles of a polygon. To their credit, the authors only claim that what they have shown works for convex polygons. It is left to the reader to wonder if the trick can be adapted to polygons in general.

Without looking up the answer, can you show with proof whether any n-sided polygon can be decomposed into n-2 triangles?

P105586


i smell old yank algebra 1 & 2 / geometry textbooks

Yes I can, most people can what is the point of this thread anyway, we have a good thread and then retarded waste of oxygen *****s like you, shit bait and kill yourself.

P106052
You can't, can you?