pinealservo
/
wiki
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fix math

master
Levi Pearson 2014-01-25 00:38:43 -07:00
parent 85b4cc133b
commit 7cc3a4d356
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
math/computational_geometry/notes.page
View File

@ -90,5 +90,5 @@ $P$ if and only if $P$ is a convex polygon.
**Theorem 1.19** **Theorem 1.19**
: The number of triangulations of a convex polygon with $n + 2$ : The number of triangulations of a convex polygon with $n + 2$
vertices is the Catalan number $$ C_n = \frac{1}{n + 1}{n + 1 \choose vertices is the Catalan number $$ C_n = \frac{1}{n + 1}{2n \choose n}
n} $$ $$