Triangulation and proof by string induction


Assignment:

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.

Provide complete and step by step solution for the question and show calculations and use formulas.

Solution Preview :

Prepared by a verified Expert
Algebra: Triangulation and proof by string induction
Reference No:- TGS01929392

Now Priced at $20 (50% Discount)

Recommended (90%)

Rated (4.3/5)