Mention that a composite that passes a heuristic primality test is kown as a pseudoprime - libzahl - big integer library
 (HTM) git clone git://git.suckless.org/libzahl
 (DIR) Log
 (DIR) Files
 (DIR) Refs
 (DIR) README
 (DIR) LICENSE
       ---
 (DIR) commit b86683847ecd3e67274330b67d257db463629969
 (DIR) parent 3fb7d372cb6f6b0e8a942a9b3e0f89a5548ab699
 (HTM) Author: Mattias Andrée <maandree@kth.se>
       Date:   Sun, 24 Jul 2016 18:16:36 +0200
       
       Mention that a composite that passes a heuristic primality test is kown as a pseudoprime
       
       Signed-off-by: Mattias Andrée <maandree@kth.se>
       
       Diffstat:
         M doc/exercises.tex                   |       5 +++--
       
       1 file changed, 3 insertions(+), 2 deletions(-)
       ---
 (DIR) diff --git 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.