Three technical remarks about GMP functions

[Sisyphus]

----- Original Message ----- 
From: "NUNES" <raulnunes at yahoo.com>

> 1st - I've created a base of primes going from 2 thru 2^32-5 (that is,
primes that can be stored in 32-bits words).

Haven't fully looked at what you're doing, but you may well find that it's
more efficient to generate the primes on the fly and read them from memory,
rather than read them from disk. See (eg)
http://primes.utm.edu/links/programs/sieves/binary_quadratic/ .

Cheers,
Rob