Jeff Woods wrote:
At 01:11 PM 7/30/01 -0500, you wrote:
I stepped away from my machine at 99.92% completion of its iterations,
and when I came back it was 0.04% into processing the next number. Is
there some way I can see what happened? Some sort of log file?
Check the file RESULTS.TXT
I think it is more the following situatiuon:
95+% done, connecting to prime.net - GET NEW WORK !! - start with new
work !
After 5-7% the old workfile gets it's active flag back and will be
completed.
This situation is really b*llsh*t, imagine the new number is very high,
it tooks 1
Hi,
At 04:37 PM 7/31/2001 +0200, Christian Goetz wrote:
95+% done, connecting to prime.net - GET NEW WORK !! - start with new
work !
This situation is really b*llsh*t, imagine the new number is very high, it
tooks 1 week to complete the 7% mark and complete the old nonprime.
I've already
I think it is more the following situatiuon:
95+% done, connecting to prime.net - GET NEW WORK !! - start with
new work !
After 5-7% the old workfile gets it's active flag back and will be
completed.
The work done on the new exponent is either trail factoring or P-1
factoring. Trail
Hi all,
I'm a bit puzzled. The other day, I donated blood and kept my mind
busy by doing LL tests on a few exponents mentally. I kept getting
the result that the LL test for M(2) ends up resulting in a repeating
value of -1, and certainly cannot ever become zero. Am I missing
something really
-Original Message-
From: George Woltman [EMAIL PROTECTED]
To: Jeroen [EMAIL PROTECTED]; [EMAIL PROTECTED] [EMAIL PROTECTED]
Date: 31 July 2001 04:01
Subject: Re: Mersenne: What is done during a LL and what are the timing
1% of time - Do something with the result to multiply it with
How did you get -1?
Lucas-Lehmer Test: For p odd, the Mersenne number 2p-1 is prime if and only
if 2p-1 divides S(p-1) where S(n+1) = S(n)2-2, and S(1) = 4.
You missed the premise for p odd.
And even so, S(p-1)/(2p-1) with p = 2; S(1)/3 = 4/3.
Carleton
- Original Message -
From:
-Original Message-
From: Nathan Russell [EMAIL PROTECTED]
To: [EMAIL PROTECTED] [EMAIL PROTECTED]
Date: 31 July 2001 19:51
Subject: Mersenne: M(2) - composite?!
Hi all,
I'm a bit puzzled. The other day, I donated blood and kept my mind
busy by doing LL tests on a few exponents
I'm after a simple program that can manage a list of factors.
With some expression dependant on a single variable such as n,
I'd like it to be able to accept new factors for a given n,
check they are factors, then rewrite the factor list including
the length of the remaining cofactor. I'd be
From: Nathan Russell [EMAIL PROTECTED]
Hi all,
I'm a bit puzzled. The other day, I donated blood and kept my mind
busy by doing LL tests on a few exponents mentally. I kept getting
the result that the LL test for M(2) ends up resulting in a repeating
value of -1, and certainly cannot
I would have just sent this to George, but I thought others might want
to comment.
I think the -m (menu) option of mprime deserves better press. The only
negative about starting mprime with it it is that the menu choice of 6
is needed to start LL checking (or whatever). After that the -d
Christian Goetz wrote:
95+% done, connecting to prime.net - GET NEW WORK !! - start with new
work !
This situation is really b*llsh*t,
Not BS at all; the replies to this original post have taught me
a bit about how Prime95 maximizes the resources of the client
pc, particularly those on dial up
12 matches
Mail list logo
