diff options
| author | Mattias Andrée <maandree@kth.se> | 2016-05-13 20:50:39 +0200 |
|---|---|---|
| committer | Mattias Andrée <maandree@kth.se> | 2016-05-13 20:50:39 +0200 |
| commit | 91881e515fe1d295c7a5f26c7a79532746fba7f3 (patch) | |
| tree | 4054b89a4ccb4d6fe9fcf4ab9f11730bd0117d79 /doc | |
| parent | Fix typo (diff) | |
| download | libzahl-91881e515fe1d295c7a5f26c7a79532746fba7f3.tar.gz libzahl-91881e515fe1d295c7a5f26c7a79532746fba7f3.tar.bz2 libzahl-91881e515fe1d295c7a5f26c7a79532746fba7f3.tar.xz | |
Minor fix to the text
Signed-off-by: Mattias Andrée <maandree@kth.se>
Diffstat (limited to 'doc')
| -rw-r--r-- | doc/number-theory.tex | 4 |
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. |