diff --git a/content/blog/01_cs325_languages_hw2.md b/content/blog/01_cs325_languages_hw2.md
index 45d17c2..d0f9c60 100644
--- a/content/blog/01_cs325_languages_hw2.md
+++ b/content/blog/01_cs325_languages_hw2.md
@@ -143,7 +143,7 @@ def prog(xs):
     return (state, total+left+right)
 ```
 
-Honestly, that's pretty clean. As clean as `left.reverse()` to allow for \\(O(1)\\) pop is.
+Honestly, that's pretty clean. As clean as `left.reverse()` to allow for \(O(1)\) pop is.
 What's really clean, however, is the implementation of mergesort in our language.
 It goes as follows: