Re: CLN, GMP inputs

[Hans Aberg]

At 09:14 +1000 2001/04/30, Kevin Ryde wrote:
>> Then, when n is not 2^k (or 0), one gets the other Z/nZ.
...
>It'll no doubt get done at
>some stage, though in fact remainders just with mpz_mod or whatever
>aren't too bad.

I think that one should perhaps add mod and division a = q*b + r so that
abs(r) <= abs(b)/2. I think this might be faster when working mod n (in
Z/nZ). For example, gcd converges faster.

In general, if it is easy to build something on top on GMP say in C++, then
I do not think there is any point adding it to GMP itself.

  Hans Aberg
                  * Email: Hans Aberg <mailto:address@hidden>
                  * Home Page: <http://www.matematik.su.se/~haberg/>
                  * AMS member listing: <http://www.ams.org/cml/>