diff options
| author | Mattias Andrée <maandree@kth.se> | 2016-11-29 23:55:29 +0100 |
|---|---|---|
| committer | Mattias Andrée <maandree@kth.se> | 2016-11-29 23:55:29 +0100 |
| commit | 781e9d05388539d989e3578ebc7f8a7cd038aeb0 (patch) | |
| tree | 05939095a7ddc9c5da12b48df2c471bf238da2e3 /doc/not-implemented.tex | |
| parent | manual: fix truncated sentence (diff) | |
| download | libzahl-781e9d05388539d989e3578ebc7f8a7cd038aeb0.tar.gz libzahl-781e9d05388539d989e3578ebc7f8a7cd038aeb0.tar.bz2 libzahl-781e9d05388539d989e3578ebc7f8a7cd038aeb0.tar.xz | |
Fix errors in the manual (most of them found by Ivan Zuboff)
Signed-off-by: Mattias Andrée <maandree@kth.se>
Diffstat (limited to 'doc/not-implemented.tex')
| -rw-r--r-- | doc/not-implemented.tex | 9 |
1 files changed, 6 insertions, 3 deletions
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 |