From 85b4cc133beba1b7df940a47edfaa22967398dba Mon Sep 17 00:00:00 2001
From: Levi Pearson <levi.pearson@harman.com>
Date: Sat, 25 Jan 2014 00:37:38 -0700
Subject: [PATCH] Changes

---
 math/computational_geometry/notes.page | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/math/computational_geometry/notes.page b/math/computational_geometry/notes.page
index 7efa6b7..b952b7f 100644
--- a/math/computational_geometry/notes.page
+++ b/math/computational_geometry/notes.page
@@ -90,5 +90,5 @@ $P$ if and only if $P$ is a convex polygon.
 
 **Theorem 1.19**
 : 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}{n + 1 \choose
 n} $$