I wrote this fast implementation for PE problems as well, but mostly for SOLSTRAS challenge at spoj.pl. It is based on "memoryless" variant of the sieve of Eratosthenes (over priority queue). I heard that sieve of Atkins may be much faster, but cannot investigate it right now. A good test may be to diff primes64 output with the output of current primes program from bsdgames package, then testing difference by Miller-Rabin.
-- You received this bug notification because you are a member of Ubuntu Bugs, which is subscribed to Ubuntu. https://bugs.launchpad.net/bugs/725367 Title: primes returns composites To manage notifications about this bug go to: https://bugs.launchpad.net/ubuntu/+source/bsdgames/+bug/725367/+subscriptions -- ubuntu-bugs mailing list ubuntu-bugs@lists.ubuntu.com https://lists.ubuntu.com/mailman/listinfo/ubuntu-bugs
