Mersenne Digest       Sunday, September 10 2000       Volume 01 : Number 776




----------------------------------------------------------------------

Date: Thu, 7 Sep 2000 02:19:55 EDT
From: [EMAIL PROTECTED]
Subject: Mersenne: Mersenne Primes Essay

After a long and agonizing wait, I have finally received Official (TM) 
permission from the International Bacclaureate Organization to post my 
Mersenne Primes extended essay on the Internet.  (Copyrights stink.  Then 
again, they did give me an A.)  Now that it's all legit, it's back on the 
Internet at
http://homepages.go.com/~joekorovin/Mersenne.html
(so the www.mersenne.org link isn't broken anymore, yay), and in a much nicer 
HTML form provided by Barry Brake.  Things have changed since Nov. 1999; I no 
longer believe that there's a hidden Mersenne prime (although it was sure fun 
to suggest), but I still remain reasonably convinced about the validity of my 
conjecture.

Stephan T. Lavavej
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt

------------------------------

Date: Thu, 7 Sep 2000 14:25:49 -0000
From: "Brian J. Beesley" <[EMAIL PROTECTED]>
Subject: Mersenne: Volunteers wanted

Hi guys,

I've been assisting in quality assurance testing of Prime95 for some 
time and have had one of my systems run halfway through a LL test on 
a 10 million digit number. Unfortunately the intermediate result I 
have does not match the only other available value, which means that 
one of us is wrong.

The problem could be a program bug (unlikely), an undiscovered bug in 
either Athlon or Pentium III floating-point arithmetic (again 
unlikely) or a random hardware glitch in either my system or the 
system against which I'm checking (much the most likely).

To eliminate the first two possibilities it is neccessary to re-run 
the first half of the test. As I have savefiles at 1 million 
iteration intervals this could be done in parallel by 17 systems; I 
will be running (at least) one of these myself but would like to 
recruit 16 volunteers to check the remaining intervals.

Volunteers should be running Prime95 or mprime v20.6 on an Intel 
Pentium II or PIII system. Please do not volunteer if you intend to 
run on an Athlon since this would make it impossible to determine if 
a processor bug is to blame. You will need to upload the save file, a 
binary file approximately 5 megabytes in size, from my ftp site, and 
unzip it; your segment of the work will take 13 CPU days (on a 
PII-400, according to George Woltman's benchmarks) with checkpoints 
at 1.3 day intervals. You should be prepared to check each checkpoint 
and report to me immediately should you find a discrepancy. I would 
like to finish the work as soon as reasonably possible, so reasonably 
fast systems are indicated - at least PII-400 running continuously.

Unfortunately I cannot offer any recognition other than my personal 
thanks. (i.e. no CPU time credit, sorry!)

If you're interested, please reply to me and I'll supply further 
instructions (how to download your specific file, precise details of 
how to set up the run and a list of my intermediate residuals at your 
checkpoints to compare with your values).


Regards
Brian Beesley
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt

------------------------------

Date: Thu, 7 Sep 2000 09:27:31 -0500
From: "Steve" <[EMAIL PROTECTED]>
Subject: Re: Mersenne: P-1 Credit

I've found 2 factors so far during P-1 testing and received 0.001 years
(about 8 or 9 hours) credit for each. Not much consolation as it 'cost'
upwards of 100 P90 hours each to find them, but it beats getting no credit
for spending the same amount of time not finding any.

Steve "binarydigits" Harris
[EMAIL PROTECTED]

- -----Original Message-----
From: Terry S. Arnold <[EMAIL PROTECTED]>
To: [EMAIL PROTECTED] <[EMAIL PROTECTED]>
Date: Thursday, September 07, 2000 1:46 AM
Subject: Mersenne: P-1 Credit


>Does anyone have any skinny on when we will start getting credit for
>1.      doing P-1 testing?
>2.      finding a factor during P-1 testing?
>
>Terry
>
>Terry S. Arnold 2975 B Street San Diego, CA 92102 USA
>[EMAIL PROTECTED] (619) 235-8181 (voice) (619) 235-0016 (fax)
>
>_________________________________________________________________________
>Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
>Mersenne Prime FAQ      -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt

_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt

------------------------------

Date: Thu, 7 Sep 2000 20:47:03 -0000
From: "Brian J. Beesley" <[EMAIL PROTECTED]>
Subject: Re: Mersenne: P-1 Credit

On 7 Sep 00, at 9:27, Steve wrote:

> I've found 2 factors so far during P-1 testing and received 0.001 years
> (about 8 or 9 hours) credit for each. Not much consolation as it 'cost'
> upwards of 100 P90 hours each to find them, but it beats getting no credit
> for spending the same amount of time not finding any.

You always did get a small amount of credit for finding a factor 
(using trial factoring) compared with the effort that went in i.e. 
you got about 10x as much credit for running trial factoring 
unsuccessfully than for finding the "largest possible" factor in the 
range you were searching.

I think PrimeNet credits factors found using P-1 as though they were 
found using trial factoring.

However there is, as yet, no credit given for unsuccessful P-1 
factoring effort.

Don't lose sight of the fact that the purpose of running P-1 is to 
save time overall by avoiding running LL tests on those exponents 
which happen to be susceptible to P-1 factoring effort.

Also, if you're running LL tests, you're certainly spending not more 
than 5% of your total effort running P-1 (significantly less than 
that if you're running double-checks), which is more than offset by 
the efficiency improvement between v18 and v19.


Regards
Brian Beesley
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt

------------------------------

Date: Thu, 07 Sep 2000 13:54:14 -0700
From: Eric Hahn <[EMAIL PROTECTED]>
Subject: Re: Mersenne: P-1 Credit

Terry S. Arnold wrote:
>Does anyone have any skinny on when we will start getting credit for
>1.      doing P-1 testing?
>2.      finding a factor during P-1 testing?

AFAIK, from what George has said, credit will eventually be given
after BOTH v21 comes out, and the Scott has time to do some 
modifications to the PrimeNet server...  Time Frame?  ...??????...

Eric



_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt

------------------------------

Date: Sun, 10 Sep 2000 07:18:02 EDT
From: [EMAIL PROTECTED]
Subject: Mersenne: Re: A new series of Mersenne-like Gaussian primes

Hi, Yann.
I don't have any Linux software. For searching for new primes of this series, 
the best program to use at present is PrimeForm/GW by Chris Nash. You could 
ask him ([EMAIL PROTECTED]) whether he has anything for Linux.
Best regards,
Mike Oakes

<<
 Date: Sun, 03 Sep 2000 15:11:23 +0200
 From: Yann Forget <[EMAIL PROTECTED]>
 Subject: Mersenne: Re: A new series of Mersenne-like Gaussian primes
 
 Hi,
 > From: [EMAIL PROTECTED]
 > 
 > In 1969 I investigated the series of complex (Gaussian) integers:
 >   s[n] = (1+i)^n - 1.
 [skip]
 > I hereby solicit the aid of those in GIMPS et al. to extend this series of
 > primes!
 
 Do you have a program, preferably in C, which would work on Linux ?
 Yann
>>
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt

------------------------------

End of Mersenne Digest V1 #776
******************************

Reply via email to