From: Dee Zsombor Date: 2005-06-23T17:30:37+09:00 Subject: Re: 1. Ruby result: 101 seconds , 2. Java result:9.8 seconds, 3. Perl result:62 seconds As far as I understood from Miller-Rabin-Test is for determining if a number is prime with a _given_ _probability_. It is a very efficient algortithm for that. The Atkins sieve (binary quadratic forms) is about generating all primes less than given number. And that is an entirely different problem, even if you woud do MR in a loop you would not get the same results as Atkin sieve. -- http://deezsombor.blogspot.com