[doc/algorithms.tex] Added another \cdot for readability.

git-svn-id: svn://scm.gforge.inria.fr/svn/mpfr/trunk@11997 280ebfd0-de03-0410-8827-d642c229c3f4

1 files changed, 1 insertions, 1 deletions

diff --git a/doc/algorithms.tex b/doc/algorithms.tex
index 9b7ad9023..4cedf794a 100644
--- a/doc/algorithms.tex
+++ b/doc/algorithms.tex
@@ -1861,7 +1861,7 @@ The error on $r$ is bounded by $\frac{1}{2} \ulp(v) + \frac{1}{2} \ulp(r)$.
 Assume $\ulp(v) = 2^k \ulp(r)$, with $k \geq 0$;
 then the error on $r$ is bounded by $\frac{1}{2} (2^k+1) \ulp(r)$.
 We can thus write $r = (e^{2x}-1) (1+\theta_3)^{2^k+1}$,
-and then $s = \tanh(x) (1+\theta_4)^{2^k+4}$.
+and then $s = \tanh(x) \cdot (1+\theta_4)^{2^k+4}$.
 
 \begin{lemma}
 For $|x| \leq 1/2$, and $|y| \leq |x|^{-1/2}$, we have: