2009/9/4 Cactus <[email protected]> > > Looking quickly at the code, it seems that a version with sieving has > been written but it hasn't been tested or enabled. >
In fact for large n values it would be faster to use more primes at sieve using a remainder tree instead of one expensive division for each prime, what is the current code doing. This is a known trick, and discussed also on the gmp list as I can remember. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "mpir-devel" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en -~----------~----~----~----~------~----~------~--~---
