diff --git a/chapters/part1/combinatorics/index.html b/chapters/part1/combinatorics/index.html
index 7d4e2171..f6d8cbb2 100644
--- a/chapters/part1/combinatorics/index.html
+++ b/chapters/part1/combinatorics/index.html
@@ -26,7 +26,7 @@ <h2 id="perm_distinct">Permutations of Distinct Objects</h2>
 	<div class="bordered">
 		<p><b><i>Definition</i></b>: Permutation Rule</p>
 
-		<p>A permutation is an ordered arrangement of n distinct objects. Those $n$ objects can
+		<p>A permutation is an ordered arrangement of $n$ distinct objects. Those $n$ objects can
 be permuted in $n \cdot (n – 1) \cdot (n – 2)  \cdots 2  \cdot 1 = n!$ ways.</p>
 	</div>
 </p>
@@ -194,7 +194,7 @@ <h2 id="comb_distinct">Combinations of Distinct Objects</h2>
 	<div class="bordered">
 		<p><b><i>Definition</i></b>: Combinations</p>
 
-		<p>A combination is an unordered selection of r objects from a set of n objects. If all objects
+		<p>A combination is an unordered selection of $r$ objects from a set of $n$ objects. If all objects
 are distinct, and objects are not "replaced" once selected, then the number of ways of making the selection is:</p>
 <p class="mathLeft">
 	$$