diff --git a/latex/problems/problem9.tex b/latex/problems/problem9.tex
index 23beec4..5bbd5ea 100644
--- a/latex/problems/problem9.tex
+++ b/latex/problems/problem9.tex
@@ -49,7 +49,7 @@ Calculating the first values to see a pattern
 
 \subsection*{b)}
 % Find FLOPs
-For every iteration of i in forward sweep we have 2 division, and 2 additions, resulting in $4(n-1)$ FLOPs. 
+For every iteration of i in forward sweep we have 2 divisions, and 2 additions, resulting in $4(n-1)$ FLOPs. 
 For backward sweep we have 1 division, and for every iteration of i we have 1 addition, and 1 division, resulting in $2(n-1)+1$ FLOPs. 
 Total FLOPs for the special algorithm is $6(n-1)+1$.