aboutsummaryrefslogtreecommitdiffstats
path: root/doc/exercises.tex
diff options
context:
space:
mode:
authorMattias Andrée <maandree@kth.se>2016-11-30 10:15:59 +0100
committerMattias Andrée <maandree@kth.se>2016-11-30 10:15:59 +0100
commitaeb5e44a98cb4158528206c079654357b1c75b16 (patch)
tree3f18e8caabcd997afbd24458a34f82fe3ce74a49 /doc/exercises.tex
parentFix errors in the manual (most of them found by Ivan Zuboff) (diff)
downloadlibzahl-aeb5e44a98cb4158528206c079654357b1c75b16.tar.gz
libzahl-aeb5e44a98cb4158528206c079654357b1c75b16.tar.bz2
libzahl-aeb5e44a98cb4158528206c079654357b1c75b16.tar.xz
Fix errors in the manual (most of them found by Ivan Zuboff)
Signed-off-by: Mattias Andrée <maandree@kth.se>
Diffstat (limited to 'doc/exercises.tex')
-rw-r--r--doc/exercises.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/exercises.tex b/doc/exercises.tex
index 3a9df19..9a18b99 100644
--- a/doc/exercises.tex
+++ b/doc/exercises.tex
@@ -596,7 +596,7 @@ ptest_llt(z_t n)
$M_n$ is composite if $n$ is composite, therefore,
if you do not expect prime-only values on $n$, the
-performance can be improve by using some other
+performance can be improved by using some other
primality test (or this same test if $n$ is a
Mersenne number) to first check that $n$ is prime.