Minor correction in modular arithmetic proof

main.tex

@@ -1500,7 +1500,7 @@ and the final logical equivalence is just a simplification of the expressions.
 	\label{eqn:better_eps_problem_k_mod_n}
 \\ &&&
 	\mod \gcd\left(
-		\frac{n^2\gcd(m,n)}{\gcd(m,2n^2)},
+		\frac{n^2\gcd(m,2)}{\gcd(m,2n^2)},
 		\frac{mn \aa}{\gcd(m,2n^2)}
 	\right)
 	\span \span \span