On 6/1/07, Mike McCarty <[EMAIL PROTECTED]> wrote: > > David kerber wrote: > > What is the question? > > > > [snip] > > >>I hope that my algorithm is faster then the sieve of Eratosthenes, > >>because the density of the primes is nearly constant concerning the > >>primes you can found on the polynoms. > > I guess the question is "Is it faster than the sieve of E.?" > > I'd have to say "no". The main loop of the sieve is an addition and an assignment. This thing has multiplications and powers.
-- Esse Quam Videre To Be, rather than to Seem _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
