Big integer division efficiency

[Paul Zimmermann]

       Dear Marian,

> One of the main bottlenecks in our code is a loop that needs to call the
> function
> 
> *mpz_fdiv_qr_ui* 
> 
> very often (more than million times a second).

I guess your problem lies in the "refactoring" part of MPQS or NFS.
I suggest you consider alternative methods for factoring out small
primes in a given integer, for example http://cr.yp.to/papers.html#smoothparts
and the references herein.

If your car is slow, instead of trying to speed it up, buy a faster one!

Paul Zimmermann