document.write( "Question 843884: If a polygon has n sides, how many triangles are formed by drawing all diagonals from one vertex?
\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #508409 by KMST(5328)![]() ![]() You can put this solution on YOUR website! I would make that polygon a convex polygon, \n" ); document.write( "like this: \n" ); document.write( "The answer may be the same for a concave polygon, like this \n" ); document.write( " \n" ); document.write( "I believe the answer is \n" ); document.write( "A polygon with \n" ); document.write( "From one of the n vertices, you can draw \n" ); document.write( "(The lines connecting to the \n" ); document.write( "To one side of each diagonal is a triangle, and you count \n" ); document.write( "one to that side of the first diagonal, \n" ); document.write( "a second one to that side of the second diagonal, and so on. \n" ); document.write( "You count \n" ); document.write( "There is |