diff --git a/latex/problems/problem9.tex b/latex/problems/problem9.tex
index 5b93eae..23beec4 100644
--- a/latex/problems/problem9.tex
+++ b/latex/problems/problem9.tex
@@ -53,6 +53,3 @@ For every iteration of i in forward sweep we have 2 division, and 2 additions, r
 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$.
 
-
-\subsection*{)}
-% Code