From 781e9d05388539d989e3578ebc7f8a7cd038aeb0 Mon Sep 17 00:00:00 2001
From: Mattias Andrée <maandree@kth.se>
Date: Tue, 29 Nov 2016 23:55:29 +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/not-implemented.tex | 9 ++++++---
 1 file changed, 6 insertions(+), 3 deletions(-)

(limited to 'doc/not-implemented.tex')

diff --git a/doc/not-implemented.tex b/doc/not-implemented.tex
index 9b3c6cb..59b3efb 100644
--- a/doc/not-implemented.tex
+++ b/doc/not-implemented.tex
@@ -84,9 +84,12 @@ more about this, I refer you to Wikipeida.
 \( \displaystyle{
     \mbox{lcm}(a, b) = \frac{\lvert a \cdot b \rvert}{\mbox{gcd}(a, b)}
 }\)
+\vspace{1em}
 
-Be aware, {\tt zgcd} can return zero.
-
+$\mbox{lcm}(a, b)$ is undefined when $a$ or
+$b$ is zero, because division by zero is
+undefined. Note however that $\mbox{gcd}(a, b)$
+is only zero when both $a$ and $b$ is zero.
 
 \newpage
 \section{Modular multiplicative inverse}
@@ -309,7 +312,7 @@ TODO % Square: Cipolla's algorithm, Pocklington's algorithm, Tonelli–Shanks al
 }\)
 \vspace{1em}
 
-This can be implemented much more efficently
+This can be implemented much more efficiently
 than using the naïve method, and is a very
 important function for many combinatorial
 applications, therefore it may be implemented
-- 
cgit v1.2.3-70-g09d2

