diff options
author | vlefevre <vlefevre@280ebfd0-de03-0410-8827-d642c229c3f4> | 2007-05-07 09:01:39 +0000 |
---|---|---|
committer | vlefevre <vlefevre@280ebfd0-de03-0410-8827-d642c229c3f4> | 2007-05-07 09:01:39 +0000 |
commit | 141b53777378d963f4bb9c31795490e78b16c739 (patch) | |
tree | 1ee0a957b1ad02fc53ad69e519309575b3aba408 /algorithms.tex | |
parent | 9bc4f3d061519ae10f012d2b5715abea5992d2ba (diff) | |
download | mpfr-141b53777378d963f4bb9c31795490e78b16c739.tar.gz |
algorithms.tex: improved the description of mpfr_remquo.
git-svn-id: svn://scm.gforge.inria.fr/svn/mpfr/trunk@4449 280ebfd0-de03-0410-8827-d642c229c3f4
Diffstat (limited to 'algorithms.tex')
-rw-r--r-- | algorithms.tex | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/algorithms.tex b/algorithms.tex index 3d2394c35..d98b3ed55 100644 --- a/algorithms.tex +++ b/algorithms.tex @@ -822,9 +822,9 @@ $x \cmod y := x - q y$, where $q = \lfloor x/y \rceil$, with ties rounded to the nearest even integer, as in the rounding to nearest mode. -Additionally, \texttt{mpfr\_remquo} returns a value equal to $q$ +Additionally, \texttt{mpfr\_remquo} returns a value congruent to $q$ modulo $2^n$, where $n$ is a small integer (say $n \leq 64$, see the -documentation). +documentation), and having the same sign as $q$ or being zero. This can be efficiently implemented by calling \texttt{mpfr\_remainder} on $x$ and $2^n y$. Indeed, if $x = r' \cmod (2^n y)$, and $r' = q' y + r$ with $|r| \leq y/2$, then |