Fix errors in the manual found by Ivan Zuboff - libzahl - big integer library | |
git clone git://git.suckless.org/libzahl | |
Log | |
Files | |
Refs | |
README | |
LICENSE | |
--- | |
commit cf4b5d338225ac30d8f7434768c45619928bf3bf | |
parent aeb5e44a98cb4158528206c079654357b1c75b16 | |
Author: Mattias Andrée <[email protected]> | |
Date: Wed, 30 Nov 2016 10:55:09 +0100 | |
Fix errors in the manual found by Ivan Zuboff | |
Signed-off-by: Mattias Andrée <[email protected]> | |
Diffstat: | |
M doc/not-implemented.tex | 17 +++++++++-------- | |
M doc/number-theory.tex | 2 +- | |
2 files changed, 10 insertions(+), 9 deletions(-) | |
--- | |
diff --git a/doc/not-implemented.tex b/doc/not-implemented.tex | |
@@ -2,11 +2,12 @@ | |
\label{chap:Not implemented} | |
In this chapter we maintain a list of | |
-features we have chosen not to implement, | |
-but would fit into libzahl, had we not have | |
-our priorities straight. Functions listed | |
-herein will only be implemented if it is | |
-shown that it would be overwhelmingly | |
+features we have chosen not to implement at | |
+the moment, but may add when libzahl matures, | |
+but to a separate library that could be made | |
+to support multiple bignum libraries. Functions | |
+listed herein will only be implemented if it | |
+is shown that it would be overwhelmingly | |
advantageous. For each feature, a sample | |
implementation or a mathematical expression | |
on which you can base your implementation is | |
@@ -25,9 +26,9 @@ and therefore do not fit into libzahl, | |
and will not be included in this chapter. | |
Operators and functions that grow so | |
ridiculously fast that a tiny lookup table | |
-constructed to cover all practical input | |
-will also not be included in this chapter, | |
-nor in libzahl. | |
+can be constructed to cover all practical | |
+input will also not be included in this | |
+chapter, nor in libzahl. | |
\vspace{1cm} | |
\minitoc | |
diff --git a/doc/number-theory.tex b/doc/number-theory.tex | |
@@ -208,7 +208,7 @@ It is certain that {\tt a} is not prime. | |
If and only if {\tt NONPRIME} is returned, a | |
value will be assigned to {\tt w} — unless | |
{\tt w} is {\tt NULL}. This will be the witness | |
-of {\tt a}'s completeness. If $a \le 2$, it | |
+of {\tt a}'s completeness. If $a \le 1$, it | |
is not really composite, and the value of | |
{\tt a} is copied into {\tt w}. | |