Author: Mattias Andrée <maandree_AT_kth.se>
AuthorDate: Fri May 13 20:50:39 2016 +0200
Commit: Mattias Andrée <maandree_AT_kth.se>
CommitDate: Fri May 13 20:50:39 2016 +0200
Minor fix to the text
Signed-off-by: Mattias Andrée <maandree_AT_kth.se>
diff --git a/doc/number-theory.tex b/doc/number-theory.tex
index eb57ef5..10c485b 100644
_AT_@ -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.
Received on Fri May 13 2016 - 20:50:43 CEST
This archive was generated by hypermail 2.3.0
: Fri May 13 2016 - 21:00:17 CEST