SOLUTION: The possible triangulations T(n) of an n-gon, for n = 3, 4, and 5 are T(3) = 1 (A triangle is its own triangulation) T(4) = 2 (A convex quadrilateral can be triangulated diagon

Algebra.Com
Question 637939: The possible triangulations T(n) of an n-gon, for n = 3, 4, and 5
are
T(3) = 1 (A triangle is its own triangulation)
T(4) = 2 (A convex quadrilateral can be triangulated diagonally on each of two diagonals)
T(5)= 5 ((A pentagon can be triangulated with two segments joining each vertex to its two opposite vertices)
Determine T(n) for n = 6, 7, and 8
Need Formula please! Thank you in advance.
Answer by jim_thompson5910(35256)   (Show Source): You can put this solution on YOUR website!
I'm not sure how it works or how it's derived entirely, but the formula for triangulating any n-gon (n is an integer and n >= 3) is



Source: 

Pickover, Clifford A. "Euler's Polygon Division Problem." The Math Book: From
       Pythagoras to the 57th Dimension, 250 Milestones in the History of 
       Mathematics. New York, NY: Sterling Pub., 2009. 184. Print.



More Source Info: 
                  Formula found in page 184 of this book. 
                  See this page (page 184) in google books here so you can see the formula for yourself.


In the case of a triangle, T(3) = (2)/(3-1)! = 2/2 = 1, which means that there is only one way to triangulate a triangle.

In the case of a quadrilateral, T(4) = (2*6)/(4-1)! = 12/6 = 2, which means that there are two ways to triangulate a quadrilateral.

In the case of a pentagon, T(5) = (2*6*10)/(5-1)! = 120/24 = 5, which means that there are 5 ways to triangulate a pentagon.

In the case of a hexagon, T(6) = (2*6*10*14)/(6-1)! = 1680/120 = 14, which means that there are 14 ways to triangulate a hexagon.

You continue this pattern to find the triangulation for any convex n-gon.
RELATED QUESTIONS

In this assignment, you examine a practical procedure used in computer-aided design and... (answered by solver91311)
Dear Tutor, Could you please explain the procedure in solving this problem: Let... (answered by Fombitz)
Let T(n) denote the number of distinct ways that a postage of n cents, where n ≥ 4 and (answered by greenestamps)
If N,E and T are distinct positive integers such that N*E*T =2013, then which of the... (answered by CubeyThePenguin)
Find the solution set of the inequality: |4t+6|≤14 A.{t: 2< t < 5} (answered by lynnlo)
Consider a regular n-gon, with all of its diagonals, where n > 4. A triangle in the... (answered by richard1234)
In this problem you will use variation of parameters to solve the nonhomogeneous equation (answered by robertb)
A sequence Tn is defined by T1 = T2 = 1 and T(n+2) = T(n+1) + Tn Tn = {{{(a^n - b^n)/... (answered by ikleyn)
Write an explicit rule for t(n) for the arithmetic sequence: 2, 5/3, 4/3, 1, 2/3,... (answered by ewatrrr)