From b86683847ecd3e67274330b67d257db463629969 Mon Sep 17 00:00:00 2001
From: Mattias Andrée <maandree@kth.se>
Date: Sun, 24 Jul 2016 18:16:36 +0200
Subject: Mention that a composite that passes a heuristic primality test is
 kown as a pseudoprime
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Signed-off-by: Mattias Andrée <maandree@kth.se>
---
 doc/exercises.tex | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

(limited to 'doc/exercises.tex')

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.
 
 
 
-- 
cgit v1.2.3-70-g09d2

