Mersenne Digest         Tuesday, June 13 2000         Volume 01 : Number 746




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

Date: Sun, 11 Jun 2000 11:21:48 EDT
From: "Nathan Russell" <[EMAIL PROTECTED]>
Subject: Re: Mersenne: Double Checking

Stefan Struiker asked:

>Is a single Double Check always enough to retire an exponent?
>
>Regards,
>Stefanovic

IIRC, George compares the residues once per week of all the double-checks 
compared that ween when he updates the database.  If they don't match, then 
either one or both of the previous runs were in error; this happens about 
1.5% of the time.  That figure can be expected to increase as people 
continue double-checking longer runs.  George reissues the mismatched 
exponents until two residues match.

Nathan
________________________________________________________________________
Get Your Private, Free E-mail from MSN Hotmail at http://www.hotmail.com

_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.tasam.com/~lrwiman/FAQ-mers

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

Date: Mon, 12 Jun 2000 01:09:25 +0100
From: "Siegmar Szlavik" <[EMAIL PROTECTED]>
Subject: Mersenne: Server busy - please try again in a few moments

Hi all,

I try to check in some results but I always get this 
error message... It says I should try it in a few moments,
but I get this message now since 4-5 days :( Any idea, 
how I could check in the results?

regards,
Siegmar


_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.tasam.com/~lrwiman/FAQ-mers

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

Date: Sun, 11 Jun 2000 17:18:34 -0700
From: Stefan Struiker <[EMAIL PROTECTED]>
Subject: Re: Mersenne: Server busy - please try again in a few moments

Same thing happens to me on "Release Exponents."  Needs to
be fixed. :-(

Best Wishes,
Stefanovic

Siegmar Szlavik wrote:

> Hi all,
>
> I try to check in some results but I always get this
> error message... It says I should try it in a few moments,
> but I get this message now since 4-5 days :( Any idea,
> how I could check in the results?
>
> regards,
> Siegmar
>
> _________________________________________________________________
> Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
> Mersenne Prime FAQ      -- http://www.tasam.com/~lrwiman/FAQ-mers

_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.tasam.com/~lrwiman/FAQ-mers

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

Date: Tue, 13 Jun 2000 00:11:19 +0100
From: gordon spence <[EMAIL PROTECTED]>
Subject: Mersenne: Factoring in the 60m range

This is a call to those people that I was mailing the results of trial 
factoring to, for numbers in the 60-69m range. To cut a long story short I 
have 'lost' your email addresses. If anyone else still wants this data, 
then please mail me off the list and I'll add you to the distribution list.

60-62m are all factored to 54 bits now, all the rest are at least 51 bits....

regards

G


_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.tasam.com/~lrwiman/FAQ-mers

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

Date: Mon, 12 Jun 2000 22:00:57 -0600
From: "Matt Goodrich" <[EMAIL PROTECTED]>
Subject: Mersenne: Slowdown in iteration speed

I just finished a Lucas Lehmer test on exponent 9822067. My PII 350 was
doing a iteration every .320 seconds. The next exponent it started was
103500203. It is now taking .421 seconds per iteration. I have a feeling
this is due to the fact it is using a different FFT. Is my assumption
correct or do I have a problem here. Would appreciate any information on
this.

As you can tell I know nothing about the math involved here. I got started
on this because I downloaded prime 95 on the recommendation of a friend. He
said it was a good way to stress test hardware. He was right about that!
After seeing the web site and what George was trying to accomplish I decided
to let my computers run it 24/7. They were on all the time anyways. I
figured they might as well be doing something productive.

Matt

_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.tasam.com/~lrwiman/FAQ-mers

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

Date: Mon, 12 Jun 2000 23:20:29 -0700
From: Eric Hahn <[EMAIL PROTECTED]>
Subject: Mersenne: Common practice for P-1 math?

Greetings all,

  I was wondering if it was common practice (ie: the norm) for
P-1 to take the product of two or more factors when giving out
a found factor, if two of more factors are found?

  To clarify, I was curious about how P-1 would indicate more
than one factor being found.  So, I took M113 and fed it into
Prime95 with the bounds of B1=200, B2=20000.  Prime95 notified
me that P-1 had found a factor in Stage #1, and that the factor
was 9734174361238150513.  This factors out to 3391 * 23279 *
65993 * 1868569, all of which are known factors of M113.

  Again, is this the norm for P-1?

Eric


_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.tasam.com/~lrwiman/FAQ-mers

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

Date: Tue, 13 Jun 2000 08:55:31 +0000
From: Alexander Kruppa <[EMAIL PROTECTED]>
Subject: Re: Mersenne: Common practice for P-1 math?

Eric Hahn wrote:

> Greetings all,
>
>   I was wondering if it was common practice (ie: the norm) for
> P-1 to take the product of two or more factors when giving out
> a found factor, if two of more factors are found?
>

Yup, each factor f, for which b^E == 1 (mod f) (b is the base, usually
3, E is the product of primes and prime powers below the bound), is
found in the GCD. They are reported as one composite factor, but it is
easy to take that one apart with a general (i.e. not only working mod
Mp) P-1 factorer.

Ciao,
 Alex.


_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.tasam.com/~lrwiman/FAQ-mers

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

Date: Tue, 13 Jun 2000 11:13:40 +0200 (MET DST)
From: "Benny.VanHoudt" <[EMAIL PROTECTED]>
Subject: Mersenne: Primenet server

Hi,


In the last three weeks prime95 hasn't succeeded in contacting the
Primenet server. I have changed the UseHTTP=0 line in the prime.ini
to UseHTTP=1 and restarted the program but it doesn't seem to
make any difference. Any suggestions ?

Thanks,
Benny

- -------------------------------------------------------------------
Benny Van Houdt,
University of Antwerp
Dept. Math. and Computer Science
PATS - Performance Analysis of Telecommunication 
       Systems Research Group
Universiteitsplein, 1
B-2610 Antwerp
Belgium
email: [EMAIL PROTECTED]    
- --------------------------------------------------------------------

_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.tasam.com/~lrwiman/FAQ-mers

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

Date: Tue, 13 Jun 2000 03:52:02 -0700
From: Stefan Struiker <[EMAIL PROTECTED]>
Subject: Mersenne: What Happens Once A Factor Has Been Reported?

To All:

Once a factor has been logged for an M-candidate, either by P-1
or by "the other" method, what M-happens?  Is a different sort
of double-checking automatically done?

Best Wishes,
Stefanovic

_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.tasam.com/~lrwiman/FAQ-mers

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

Date: Tue, 13 Jun 2000 09:29:21 -0400
From: Jeff Woods <[EMAIL PROTECTED]>
Subject: Re: Mersenne: Slowdown in iteration speed

At 10:00 PM 6/12/00 -0600, you wrote:

>I just finished a Lucas Lehmer test on exponent 9822067. My PII 350 was
>doing a iteration every .320 seconds. The next exponent it started was
>103500203. It is now taking .421 seconds per iteration. I have a feeling
>this is due to the fact it is using a different FFT. Is my assumption
>correct or do I have a problem here. Would appreciate any information on
>this.


Yes, you've jumped up in FFT size, and that slows the iteration down.  You 
can see a rough breakdown of the FFT size barriers at:

http://www.mersenne.org/status.htm

The break you passed over was at about 10,320,000.

_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.tasam.com/~lrwiman/FAQ-mers

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

Date: Tue, 13 Jun 2000 17:16:29 -0000
From: "Brian J. Beesley" <[EMAIL PROTECTED]>
Subject: Re: Mersenne: Primenet server

On 13 Jun 00, at 11:13, Benny.VanHoudt wrote:

> In the last three weeks prime95 hasn't succeeded in contacting the
> Primenet server. I have changed the UseHTTP=0 line in the prime.ini
> to UseHTTP=1 and restarted the program but it doesn't seem to
> make any difference. Any suggestions ?

Do you have a DNS server, or do you have entropia.com hardcoded into 
the "hosts" file?

If the latter, try changing the address to 216.120.55.141 which is 
the new address for www.mersenne.org - equate this to entropia.com as 
well.

Regards
Brian Beesley
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.tasam.com/~lrwiman/FAQ-mers

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

End of Mersenne Digest V1 #746
******************************

Reply via email to