document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=744948>Question 744948</A>: <I><SPAN STYLE=\"word-break: break-all;\"> So I have determined that by using Leonhard Euler's formula for polygon division<BR>\n" );
document.write( "T(6) = 14<BR>\n" );
document.write( "T(7) = 42 and <BR>\n" );
document.write( "T(8) = 132\r<BR>\n" );
document.write( "\n" );
document.write( "however I am confused about how T(n) changes when you ignore distinct vertices.<BR>\n" );
document.write( "Could you explain how to find T(n) while ignoring said vertices. \r<BR>\n" );
document.write( "\n" );
document.write( "Note: I'm not looking for the answer but rather an explanation on how to reach the answer.\r<BR>\n" );
document.write( "\n" );
document.write( "Thanks! </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #453630 by </B><A HREF=/tutors/aboutme.mpl?userid=rothauserc><B>rothauserc(4718)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=rothauserc><IMG SRC=http://www.algebra.com/images/aboutme-small.gif BORDER=0 alt=\"About Me\" VALIGN=MIDDLE></A>&nbsp;<IMG SRC=http://www.algebra.com/cgi-bin/show-face.mpl?user=rothauserc><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=453630\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> So Euler asked the following question\r<BR>\n" );
document.write( "\n" );
document.write( "In how many ways can a plane convex polygon of n sides be divided into<BR>\n" );
document.write( "triangles by diagonals?\r<BR>\n" );
document.write( "\n" );
document.write( "and his formula is\r<BR>\n" );
document.write( "\n" );
document.write( "En = 2*6*10***(4n-10) / (n-1)!\r<BR>\n" );
document.write( "\n" );
document.write( "when dividing the polygon into triangles we, of course, ignore some distant vertices when we draw the diagonals...... </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );