[hackers] [libzahl] Mention that a composite that passes a heuristic primality test is kown as a pseudoprime || Mattias Andrée

[git]

commit b86683847ecd3e67274330b67d257db463629969
Author:     Mattias Andrée <maand...@kth.se>
AuthorDate: Sun Jul 24 18:16:36 2016 +0200
Commit:     Mattias Andrée <maand...@kth.se>
CommitDate: Sun Jul 24 18:16:36 2016 +0200

    Mention that a composite that passes a heuristic primality test is kown as 
a pseudoprime
    
    Signed-off-by: Mattias Andrée <maand...@kth.se>

diff --git a/doc/exercises.tex b/doc/exercises.tex
index 42a7da2..100978f 100644
--- a/doc/exercises.tex
+++ b/doc/exercises.tex
@@ -124,8 +124,9 @@ on success and $-1$ with \texttt{errno} set to
 \item {[\textit{05}]} \textbf{Fast primality test}
 
 $(x + y)^p \equiv x^p + y^p ~(\text{Mod}~p)$
-for all primes $p$ and for a few composites $p$.
-Use this to implement a fast primality tester.
+for all primes $p$ and for a few composites $p$,
+which are know as pseudoprimes. Use this to implement
+a fast primality tester.