From aeb5e44a98cb4158528206c079654357b1c75b16 Mon Sep 17 00:00:00 2001
From: Mattias Andrée <maandree@kth.se>
Date: Wed, 30 Nov 2016 10:15:59 +0100
Subject: Fix errors in the manual (most of them found by Ivan Zuboff)
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/number-theory.tex | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

(limited to 'doc/number-theory.tex')

diff --git a/doc/number-theory.tex b/doc/number-theory.tex
index 10c485b..b4c2ece 100644
--- a/doc/number-theory.tex
+++ b/doc/number-theory.tex
@@ -145,7 +145,7 @@ definion ensures
 \noindent
 and analogously for $\frac{b}{\gcd(a,\,b)}$. Note however,
 the convension $\gcd(0, 0) = 0$ is adhered. Therefore,
-before dividing with $\gcd{a, b}$ you may want to check
+before dividing with $\gcd(a, b)$ you may want to check
 whether $\gcd(a, b) = 0$. $\gcd(a, b)$ is calculated
 with {\tt zgcd(a, b)}.
 
@@ -179,7 +179,7 @@ $\max x : 2^x \vert z$ is returned by {\tt zlsb(z)}
 \section{Primality test}
 \label{sec:Primality test}
 
-A primality of an integer can be test with
+The primality of an integer can be tested with
 
 \begin{alltt}
    enum zprimality zptest(z_t w, z_t a, int t);
@@ -235,7 +235,7 @@ test with witness return.
     
     \hspace{2ex}
     \begin{minipage}{\linewidth}
-        \STATE $k \xleftarrow{\$} \textbf{Z}_{a - 2} \setminus \textbf{Z}_{2}$
+        \STATE $k \xleftarrow{\$} \textbf{Z}_{a - 2} \setminus \textbf{Z}_{2}$ \textcolor{c}{\{Uniformly random assignment.\}}
         \STATE $x \gets k^d \mod a$
         \STATE {\bf continue} {\bf if} $x = 1$ \OR $x = a - 1$
         \STATE {\bf repeat} $r$ {\bf times or until} $x = 1$ \OR $x = a - 1$
-- 
cgit v1.2.3-70-g09d2

