Torbjorn Granlund t...@gmplib.org writes:
We could perhaps add a parallel set of functions (_ul, or _ull) allowing
long long. We should then follow the principle of one GMP release, one
GMP API and reject compilers and ABIs without long long support.
I don't see much harm in making those
ni...@lysator.liu.se (Niels Möller) writes:
Correction: Each iteration gets from \ell to 2 \ell-2, and it needs 2
\ell-1 bits of precision for intermediate values.
Yet another correction, after more work on the implementation.
For numbers x = 1 (mod 8), there are four square roots mod 2^k. If
On Jul 31, 2012, at 7:42 AM, Niels Möller wrote:
We currently have modular exponentation, powlo and regular powering
with no reduction of any kind. I'm suggesting a pow_modbnm1. For
euclidean square root, and for mpfr, it might also be useful with a
pow_high, keeping only the n most
