A more detailed documentation

Author: czurnieden

doc/bn.tex

@@ -1343,8 +1343,7 @@ \subsection{Multiplication by two}
 is implemented as a left--shift operation of $a$ by $b$ bits.
 
 It is also not very uncommon to need just the power of two $2^b$;  for example as a start--value
-for
-the Newton method.
+for the Newton method.
 
 \index{mp\_2expt}
 \begin{alltt}
@@ -2226,7 +2225,7 @@ \section{Extra Strong Lucas Test}
 mp_err mp_prime_extra_strong_lucas(const mp_int *a, bool *result)
 \end{alltt}
 Performs a extra strong Lucas test. The extra strong Lucas test together with the
-Rabin--Miller test with bases $2$ and $3$ resemble the BPSW test. The single internal use is a
+Rabin--Miller test with base $2$ resembles the BPSW test. The single internal use is a
 compile--time option in \texttt{mp\_prime\_is\_prime} and can be excluded from the Libtommath build
 if not needed.
 
@@ -2278,9 +2277,8 @@ \section{Primality Testing}
 primes up to $3\,317\,044\,064\,679\,887\ 385\,961\,981$\footnote{The semiprime $1287836182261\cdot
     2575672364521$ with both factors smaller than $2^{64}$. An alternative with all factors smaller
   than
-  $2^32$ is $4290067842\cdot 262853\cdot 1206721\cdot 2134439 + 3$}. That limit has to be checked
-by
-the caller.
+  $2^32$ is $4290067842\cdot 262853\cdot 1206721\cdot 2134439 + 3$}. Input larger than the above limits
+will return \texttt{MP\_VAL}.
 
 If $a$ passes all of the tests $result$ is set to \texttt{true}, otherwise it is set to
 \texttt{false}.