diff --git a/chapter03.tex b/chapter03.tex
index ace3d4f..00b095d 100644
--- a/chapter03.tex
+++ b/chapter03.tex
@@ -218,7 +218,7 @@ For example, the array
 \node at (7.5,0.5) {$8$};
 \end{tikzpicture}
 \end{center}
-has tree inversions: $(6,3)$, $(6,5)$ and $(9,8)$.
+has three inversions: $(6,3)$, $(6,5)$ and $(9,8)$.
 The number of inversions indicates
 how much work is needed to sort the array.
 An array is completely sorted when