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.?"
Mike
--
p="p=%c%s%c;main(){printf(p,34,p,34);}";main(){printf(p,34,p,34);}
Oppose globalization and One World Governments like the UN.
This message made from 100% recycled bits.
You have found the bank of Larn.
I can explain it for you, but I can't understand it for you.
I speak only for myself, and I am unanimous in that!
_______________________________________________
Prime mailing list
[email protected]
http://hogranch.com/mailman/listinfo/prime
