On Mon, Sep 20, 1999 at 05:45:17PM -0500, Willmore, David wrote:
Since it's a cache reading problem there's no real way to 'flush' it.
Normally, that means to write back dirty data to whatever backing store
exists, not 'invalidate everything'. Even if you did, it would't solve the
problem.
How
Wouldn't the run time at 4.231 be about 10 years?
--- Eric Hahn [EMAIL PROTECTED] wrote:
Okay, okay... obviously a lot of people were awake
sigh
(you can stop flooding me with emails!!)
In a previous message I wrote:
P.S. At the 79.3M range, you'll probably not want
to set it
at 100
On Mon, Sep 20, 1999 at 05:45:17PM -0500, Willmore, David wrote:
Since it's a cache reading problem there's no real way to 'flush' it.
Normally, that means to write back dirty data to whatever backing store
exists, not 'invalidate everything'. Even if you did, it would't solve
the
problem.
I was wondering if Prime95 is affected by the Pentium
FDIV bug. (or some name like that).
I ask this because now i'm also using it on my laptop
(great work george!) and when i installed linux some time
ago it said the processor had this bug.
Floris Looyesteyn
I was wondering if Prime95 is affected by the Pentium
FDIV bug. (or some name like that).
I ask this because now i'm also using it on my laptop
(great work george!) and when i installed linux some time
ago it said the processor had this bug.
It should not be a problem because Linux
On Tue, Sep 21, 1999 at 02:03:54PM -0500, Willmore, David wrote:
Correct, it does not. Normally, though, when you're swapping, proper L2
cache coloring is the least of your performance problems.
Yes, but if you _force_ swap-out-swap-in, like ReCache does?
/* Steinar */
--
Homepage:
On Tue, Sep 21, 1999 at 09:25:02PM +0200, Floris Looyesteyn wrote:
I was wondering if Prime95 is affected by the Pentium
FDIV bug. (or some name like that).
I've run it with on a P60 (with the FDIV bug) for 2-3 years now
(at least pre-PrimeNet), and it has never been a problem. Remember
that the
Random chance. I wouldn't count on it.
-Original Message-
From: Steinar H. Gunderson [SMTP:[EMAIL PROTECTED]]
Sent: Tuesday, September 21, 1999 4:12 PM
To: [EMAIL PROTECTED]
Subject: Mersenne: Re: Re: Timing(?) errors
On Tue, Sep 21, 1999 at 02:03:54PM -0500, Willmore,
Hi,
At 10:09 PM 9/20/99 +0300, Jukka Santala wrote:
Something I forgot from earlier playing, the manual factoring savefiles
on Prime95 v19 at least don't work out too well especially on dual-CPU
machines... Since these savefiles will always be named "p000"
regardless of the -A parameter and
Does anybody know if there is an exponent where the
factor is, or know whether there is a proof on whether
a factor can (or can't) be, a root?? A square??
To clarify this:
We know that any factor of 2^p-1 is in the form 2kp+1.
Letting x =2,
Can (2kp+1)^x = 2^p-1 ??
Can (2kp+1)^x *
Hi,
At 02:42 PM 9/18/99 +0200, Lars Lindley wrote:
I discovered a lost exponent in the team-report and thought I would
reassign that exponent for myself.
I manually edited the worktodo.ini by adding the row
DoubleCheck=3393469,61 on the first line.
I thought that prime95 would put the exponent I
Mersenne Digest Tuesday, September 21 1999 Volume 01 : Number 629
--
Date: Sun, 19 Sep 1999 21:36:01 -0400
From: Jeff Woods [EMAIL PROTECTED]
Subject: Re: Mersenne: M(M(127)) and other M(M(p))
At 08:51 PM 9/19/99
At 04:27 PM 9/21/99 -0700, Eric Hahn wrote:
We know that any factor of 2^p-1 is in the form 2kp+1.
Letting x =2,
Can (2kp+1)^x = 2^p-1 ??
Can (2kp+1)^x * (2kp+1) ... = 2^p-1 ??
No known factors of Mersenne numbers have x1, but it hasn't been proven
that it is impossible.
At 09:47 AM 9/21/1999 -0700, James Escamilla wrote:
Wouldn't the run time at 4.231 be about 10 years?
Yes, for that particular exponent (79,299,959), it would
take approx. 10 yrs. and 231 days to test.
That's assuming 4 items:
1) A P2 266MHz PC was being used the entire time.
2) The PC was
All programs are affected by the FDIV bug. It is a bug in the design of
the microprocessor. Linus has a way around it. The brain dead morons at
Microsoft have to make everyone else wait for a solution (That has yet to
come AFIK). Linux on the other hand usually has problems solved in a
matter of
Hi folks
Wait, that might just be the reason to search! Will only searched up to
k=4 for M(M(6972593)), but if 2*k*M(p)+1 divides M(M(p)), then you've just
beaten the world record! Non-Mersenne's might once again grace the top
10 list!
I really hope that neither Will Edgington (with
16 matches
Mail list logo