On Sun, Jun 08, 2008 at 04:24:43PM -0400, Antonio Cangiano wrote: > As I said above, you may have implemented a relatively fast sieve, but > it isn't useful at all when it comes to trying to find new Mersenne primes.
Actually, looking at the code, I'd guess it's quite a lot slower than the Sieve of Atkins if you implemented both in C or another similarly machine-near language. It's hard to tell, though -- the “paper” is all over the place with a lot of “and then I did this, and then I did that, and by the way, this thing over here doesn't really work at all, and I have no idea why this works but it appears to do”, so it's not all that easy to follow. /* Steinar */ -- Homepage: http://www.sesse.net/ _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
