diff --git a/08Trees.tex b/08Trees.tex
index f959685..784ed70 100644
--- a/08Trees.tex
+++ b/08Trees.tex
@@ -246,7 +246,7 @@
 至今我们还没有办法得知给定端点树的无编号树的数量的具体值。
 \begin{theorem}
     无编号$n$顶点树的数量$T_n$满足
-    \[\frac{n^{n-2}}{n} \leq T_n \leq \binom{2n-4}{2n-2}\eqper\]
+    \[\frac{n^{n-2}}{n} \leq T_n \leq \binom{2n-4}{n-2}\eqper\]
 \end{theorem}
 
 为了证明这个定理，我们要先引入Planner code：
diff --git a/离散数学.tex b/离散数学.tex
index f1f61c4..3f8c7de 100644
--- a/离散数学.tex
+++ b/离散数学.tex
@@ -53,7 +53,7 @@
 \author{}
 \date{}
 % linespread{1.5}
-\includeonly{08Trees.tex}
+% \includeonly{08Trees.tex}
 
 \begin{document}
     \maketitle