aboutsummaryrefslogtreecommitdiffstats
path: root/doc/number-theory.tex
diff options
context:
space:
mode:
Diffstat (limited to '')
-rw-r--r--doc/number-theory.tex4
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/number-theory.tex b/doc/number-theory.tex
index eb57ef5..10c485b 100644
--- a/doc/number-theory.tex
+++ b/doc/number-theory.tex
@@ -216,8 +216,8 @@ $\gcd(w, a)$ can be used to extract a factor
of $a$. This factor is however not necessarily,
and unlikely so, prime, but can be composite,
or even 1. In the latter case this becomes
-utterly useless, and therefore using this
-method for prime factorisation is a bad idea.
+utterly useless. Therefore using this method
+for prime factorisation is a bad idea.
Below is pseudocode for the Miller–Rabin primality
test with witness return.