# Triangulation, proof by string induction.

Not what you're looking for?

Use strong induction to show that when a convex polygon P with consecutive vertices VI, V2, ... , Vn is triangulated into n - 2 triangles, the n - 2 triangles can be numbered 1, 2, ... , n - 2 so that Vi is a vertex of triangle i for i = 1,2, ... , n - 2.

##### Purchase this Solution

##### Solution Summary

Strong induction is used to prove that a convex polygon with n vertices can be triangulated into (n-2) triangles with the specified numbering of vertices.

##### Solution Preview

We'll triangulate the polygon like this: start with vertex number 1. Connect the two vertices adjacent to it (the last one and the second one) with a new edge. Number the resulting triangle 1. Now, look at the rest of the polygon. It's now a convex polygon with n-1 vertices, and the vertices are numbers 2, 3, 4, ... , n. Again, "remove" the second vertex by connecting the nth and the third ...

##### Purchase this Solution

##### Free BrainMass Quizzes

##### Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

##### Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

##### Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

##### Probability Quiz

Some questions on probability

##### Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts