diff options
| author | Mattias Andrée <maandree@kth.se> | 2016-07-24 18:16:36 +0200 |
|---|---|---|
| committer | Mattias Andrée <maandree@kth.se> | 2016-07-24 18:16:36 +0200 |
| commit | b86683847ecd3e67274330b67d257db463629969 (patch) | |
| tree | 00f5e3395060f4c17a7990570c5f6fa4e28a2a6b /doc/exercises.tex | |
| parent | Make “You should already [...]” small and italic (diff) | |
| download | libzahl-b86683847ecd3e67274330b67d257db463629969.tar.gz libzahl-b86683847ecd3e67274330b67d257db463629969.tar.bz2 libzahl-b86683847ecd3e67274330b67d257db463629969.tar.xz | |
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 (limited to 'doc/exercises.tex')
| -rw-r--r-- | doc/exercises.tex | 5 |
1 files changed, 3 insertions, 2 deletions
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. |