>> but you get to test numbers that are much smaller than the M12000000
>> currently being assigned by Primenet.
>
>An operation with a GFN of 3,000,000 digits is about 4 times faster than an
>operation with a Mersenne number of 12,000,000 digits and the number of
>operations to compute to test a number 4 times smaller is divided by 4. And
>smaller is the number, larger is the probability to find a prime.
Sorry, M12000000 is a 3,600,000 digit number: then I should have written
An operation with a GFN of 2,500,000 digits is about 30 % faster than an
operation with a Mersenne number of 3,600,000 digits and the number of
operations which should be computed to test the GFN is divided by 1.44.
And smaller is the number, larger is the probability to find a prime (in
this case it is also multiply by 1.44).
Yves
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
