next up previous
Next: Triple Duel Up: Problems Previous: Polygonal Ears

How Many Triangulations?

Let tex2html_wrap_inline773 be the number of ways that a convex polygon with n sides can be triangulated using non-crossing diagonals. Verify that tex2html_wrap_inline777 , tex2html_wrap_inline779 and tex2html_wrap_inline781 . Calculate tex2html_wrap_inline783 and tex2html_wrap_inline785 .

  1. Find a way to calculate tex2html_wrap_inline773 if you already know tex2html_wrap_inline789 .
  2. Can you find a formula for tex2html_wrap_inline773 ?

Carl Lee
Wed Apr 21 08:26:07 EDT 1999