Re: Mersenne: Double-check assignment lost?

2003-02-23 Thread Walt Mankowski
On Sun, Feb 23, 2003 at 11:19:03AM -0500, George Woltman wrote:
 It is highly unlikely that someone poached this exponent.  It is not near
 a milestone and the exponent is not of any particular significance.
 
 Most likely, either 1) you got a recycled exponent and the result was
 belatedly reported,  or 2) someone operating manually and/or not
 understanding how GIMPS works tested the exponent, or 3)  the server
 glitched and handed it out twice, or even 4) the first time tester might
 have tested it again for reasons unknown, or 5) some reason I haven't
 thought of.

George,

Thanks for the update.  So what do you suggest I do now?  I've got 13
days left on the exponent.  Should I continue with what's now a
triple-check, or just move on to my next exponent?

Walt
_
Unsubscribe  list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ  -- http://www.tasam.com/~lrwiman/FAQ-mers


Re: Mersenne: scientific american

2001-07-23 Thread Walt Mankowski

On Sun, Jul 22, 2001 at 12:37:32PM -0400, Nathan Russell wrote:
 I agree that this is unfair, especially given that SETI is probably
 the only project to have more than ten thousand users and NO results

Not that they've told anybody about, at any rate... :-)

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



Re: Mersenne: 386SX

2000-03-04 Thread Walt Mankowski

On Sat, Mar 04, 2000 at 12:27:52PM -0800, John R Pierce wrote:
  I just installed Slackware 7.0 on an old 386SX and I want it
  to do distributed computing of some kind.  However, the
  lowest CPU mprime allows is a 486.  What can I do?
 
 phew.  a 386sx is SO slow I really can't imagine WHAT useful computational
 work it could do...  Thats a 25 or so MHz CPU with a 16 bit bus that
 probably takes 5-6 clocks to do a simple integer operation.  Oh, and its got
 no floating point.   I'd estimate it at least a few 100 times slower than
 even a slow celeron at numerical work.  No, wait.  make that several
 THOUSAND times slower.

It might be able to work on one of the distributed.net projects.  I
don't *think* the rc5 stuff uses floating point.
_
Unsubscribe  list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ  -- http://www.tasam.com/~lrwiman/FAQ-mers



Re: probability of primeness (was: Re: Mersenne: splitting up 10m digit primes)

1999-10-12 Thread Walt Mankowski

On Tue, Oct 12, 1999 at 10:53:18PM -0400, Darxus wrote:
 
 I'm hoping what I have to say in this email might be important.
 
 On Tue, 12 Oct 1999, George Woltman wrote:
 
  At 04:12 PM 10/12/99 -0400, you wrote:
   And how is the probability of finding a prime calculated ?
   
   It is roughly how-far-factored-in-bits * 2 / exponent
  
  Okay.. what's "how-far-factored-in-bits" mean ?
  
  I think trial factoring is done to 2^68 for an exponent around 33 million.
  Thus your chance is 2 * 68 / 3300.
 
 Okay, so as far as we know, each number is equally likely to be prime, and
 this probability is just based on how much has already been tested ?

No, they're saying the probability is based on how deeply they've
tried to factor the number before trying the LL test.  The more
numbers N you rule out as potential factors of M, the more likely M is
to be prime.

Also, although there are an infinite number of primes, their density
thins out considerably as they get large because there are so many
more potential factors below them.  This applies to primes in general;
I don't know if it applies to Mersenne primes.
_
Unsubscribe  list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ  -- http://www.tasam.com/~lrwiman/FAQ-mers



Mersenne: V19 Bug in Factoring Timing?

1999-10-10 Thread Walt Mankowski

I just upgraded this morning to the latest Linux version of Linux,
v19.0.2.  The box with the problem is a 486-66 running Red Hat 5.0.
I'm noticing some strange numbers in its output:

Factoring M10533203 to 2^64 is 39.83% complete.  310.800 sec.
Factoring M10533203 to 2^64 is 39.84% complete.  310.790 sec.
Factoring M10533203 to 2^64 is 39.84% complete.  310.630 sec.
Factoring M10533203 to 2^64 is 39.85% complete.  -3984.147 sec.
Factoring M10533203 to 2^64 is 39.86% complete.  310.720 sec.
Factoring M10533203 to 2^64 is 39.86% complete.  311.920 sec.

About one out of every 15 lines says it completed in negative time.

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



Mersenne: Error 2250 connecting to PrimeNet

1999-10-10 Thread Walt Mankowski

I have a 486-66 running RedHat 5.0 which I just upgraded to mprime
19.0.2 this morning.  It's getting error 2250 when connecting to
PrimeNet.  Here's what I see when I select "Help/About PrimeNet
Server" from the mprime menu:

 Your choice: 20

 Contacting PrimeNet Server.
 ERROR 2250: Server unavailable
 The FAQ at http://www.entropia.com/ips/faq.html may have more
 information.
 Unable to get version information from PrimeNet server.

 Hit enter to continue:

This returns immediately and it appears that it's not even trying to
connect.  When I do the same from the old (18.1.2) version it works
just fine.  I can also connect to PrimeNet from 19.0.2 on another
machine.

The FAQ suggests I might be using RPC instead of HTTP to communicate
with PrimeNet.  As far as I can tell I'm not; I have a line that says
"UseHTTP=1" in my prime.ini file.

One change I had to make between versions is that I had to switch to
using sprime.tar.gz since the old RedHat box doesn't have glibc2.1
installed.

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