Ask your own question, for FREE!
Discrete Math 16 Online
OpenStudy (alprincenofl):

A simple polygon with n sides, where n is an integer with n≥3, can be triangulated into n-2 triangles.

OpenStudy (alprincenofl):

True Or False?

Directrix (directrix):

n = 3 in this triangle. Can it be triangulated into 3-2 = 1 triangles? |dw:1416317925497:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!