diff --git a/content/blog/linear_multistep.md b/content/blog/linear_multistep.md
index f89d8b0..7662943 100644
--- a/content/blog/linear_multistep.md
+++ b/content/blog/linear_multistep.md
@@ -74,12 +74,12 @@ t_n = t_0 + nh
 {{< /latex >}}
 We can get the formula for \\(y_n\\) by looking at our aproximation steps above.
 {{< latex >}}
-\begin{gather*}
+\begin{gather}
   y_1 = y_0 + hf(t_0,y_0) \\
   y_2 = y_1 + hf(t_1,y_1) \\
   ... \\
   y_{n+1} = y_n + hf(t_n,y_n)
-\end{gather*}
+\end{gather}
 {{< /latex >}}
 
 What we have arrived at is [Euler's method](https://mathworld.wolfram.com/EulerForwardMethod.html).