Skip to content
Snippets Groups Projects
Commit 82696369 authored by Luke Naylor's avatar Luke Naylor
Browse files

Minor correction in modular arithmetic proof

parent 1742372f
No related branches found
No related tags found
No related merge requests found
Pipeline #28837 passed
......@@ -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
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment