Erm, the previous was obviously solution c), not b) =) Anyway, here's d), it uses the sieve recursively to init itself. This should allow full 64-bit range to be traversed (and potentially larger, if there is a native integer type).
** Patch added: "725367d.diff" https://bugs.launchpad.net/ubuntu/+source/bsdgames/+bug/725367/+attachment/2365772/+files/725367d.diff -- 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 [email protected] https://lists.ubuntu.com/mailman/listinfo/ubuntu-bugs
