Loading ...
Sorry, an error occurred while loading the content.

Re: Generating primes in sequence using sieve of Eratosthenes

Expand Messages
  • djbroadhurst
    ... Erato takes less than 4 seconds to reach 10^9, in Pari-GP: default(primelimit,10^9);print(gettime ms ); 3634 ms David
    Message 1 of 2 , Sep 30, 2010
    • 0 Attachment
      --- In primenumbers@yahoogroups.com,
      Kermit Rose <kermit@...> wrote:

      > it is possible to have an efficient sequential generator of primes,
      > up to the neighborhood of 10**9.

      Erato takes less than 4 seconds to reach 10^9, in Pari-GP:

      default(primelimit,10^9);print(gettime" ms");
      3634 ms

      David
    Your message has been successfully submitted and would be delivered to recipients shortly.