George Woltman writes:
Since F24 is 5 million digits your computer would take 5 minutes * 5^2,
or 2 hours. Given your machine is faster, my code is 32-bit, my code
does an extended GCD, the Alpha is a better architecture, and your code
is probably better - you come up with the factor of 12
Bill Rea writes:
At 256K FFT I was seeing 0.11 secs/iter with
Mlucas against 0.15 secs/iter for MLU, at 512K FFT the figures were
0.25 secs/iter and 0.29 secs/iter respectively.
...and don't forget the added benefits due to Mlucas being able to
test significantly larger exponents at the same
Hi,
At 04:07 PM 11/6/99 EST, [EMAIL PROTECTED] wrote:
Was your code doing a true Fermat-mod DWT, or were you attempting to
factor instead the Mersenne number M(2^25-1) = (2^(2^24)-1)*(2^(2^24)+1)?
Prime95 uses a true Fermat-mod DWT.
Impressive - can you give us a brief summary of the most
On Sat, Nov 06, 1999 at 10:47:07PM +0100, Francois E Jaccard [EMAIL PROTECTED]
wrote:
Will a version 19 for FreeBSD be available? I would like to transfer a 33M
exponent to a FreeBSD 4.0-current machine.
I'm also waiting for the FreeBSD v19 client.
Bryan
--
Bryan Fullerton
Who's sending mail to the list that makes the digests appear with a red
background in my AOL mailreader? Arrgh... afterimage... AFTERIMAGE!
S.T.L.
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ
Mersenne Digest Saturday, November 6 1999 Volume 01 : Number 656
--
Date: Wed, 03 Nov 1999 18:35:22 -0800
From: Eric Hahn [EMAIL PROTECTED]
Subject: Re: Mersenne: Trial-factorers
Brian Beesley wrote:
On 27 Oct
