Henrik Olsen wrote:
On Mon, 8 May 2000, Dave Mullen wrote:
I was thinking more in terms of ...
Let's assume that every cycle of the LL test for M(M(19)), we took the
LSB and wrote it to a file - you might find the code for the virus
there !
Chance is still way off, virus was about
Will gimps support the search for the 1,000,000,000 digit prime?
How many years would it take for a PC to factor such a prime?
Not long at all. If it is prime, its only factors are 1 and itself.
Paul
_
Unsubscribe list info --
On 7 May 00, at 17:41, [EMAIL PROTECTED] wrote:
A large significant (non-error)
part of the convolution coefficient means that any accumulated rounding
errors will collect in the least-significant few bits of the floating-point
mantissa. That's why errors close to 0.5 tend to come in the
On 9 May 00, at 7:07, Shot wrote:
Just a small proposition - could the Test | Status window display,
next to the ECDates, the corresponding day of the week?
Sounds a reasonable request to me.
but for me (am I the only one?)
it is easier to remember the day of the week.
The Great God
If the PrimeNet assignments reports are to be believed, we have
double-checked all exponents through 3M and proven M(2976221) and M(3021377)
to be respectively the 36th and 37th primes in numeric order.
Nathan
Get Your
From: Jeff Woods [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject: Re: Mersenne: Milestones?
Date: Tue, 09 May 2000 12:37:31 -0400
We still have a handful of exponents to go.
I was looking at the server's assignments out pages. I guess the
assignments in question must be non-PrimeNet.
Nathan Russell wrote:
From: Jeff Woods [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject: Re: Mersenne: Milestones?
Date: Tue, 09 May 2000 12:37:31 -0400
We still have a handful of exponents to go.
I was looking at the server's assignments out pages. I guess the
assignments in question must be
Let me rephrase something from my last message:
There should be 12 non-Primenet exponents left to finish testing
(if they aren't already) to prove both M(2976221) and M(3021377)
are the 36th and 37th Mersenne primes, respectively...
Eric
Hi,
There are 19 exponents that need triple-checking. I've just assigned them
to three volunteers. With luck, they'll all be finished up in a few weeks.
Regards,
George
_
Unsubscribe list info --
Mersenne Digest Tuesday, May 9 2000 Volume 01 : Number 733
--
Date: Sun, 7 May 2000 10:29:14 -0700
From: "John R Pierce" [EMAIL PROTECTED]
Subject: Re: Mersenne: Overclocking
There's something funny
10 matches
Mail list logo
