Re: Mersenne: V20 beta #4 (will the beta never end?)

2000-04-20 Thread David Campeau
Stage 2 factor = 1 So on my machine the stage 1 gcd saved me 2 stage 2, so about 2 hour of cpu, but at the cost of about 90 * 230 sec of stage 1 gcd = 20700sec or 5:45 hours. Seems to me that we could save a little bit by forgoing stage 1 gcd. regards, David Campeau

Mersenne: The recent popularity of Factoring

2000-03-24 Thread David Campeau
3212 I think your name imagination is running short :-) or is this a case of "Houston, I think we have a problem!" Best regards, David Campeau, _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers

Re: Mersenne: The return of poaching? (or lets all blast dave)

2000-02-05 Thread David Campeau
Fallacious because > that's the job of Primenet's expiration policy. What is the difference between keeping only small exponent and keeping only big exponent (going for 100,000$), we will reach that plateau eventually? Why did this tread went from exposing a poacher to accusing a sen

Re: Mersenne: Version 20 memory questions

2000-01-31 Thread David Campeau
ially the 80% of RAM)? > If you always leave 20% of ram to the system to work with, there should not be a problem. This is a nice problem, it's going to be interesting to see what you come up with. Regards, David Campeau, _ Unsubs

Re: Mersenne: A Windows 2000 Question (Solution?)

2000-01-25 Thread David Campeau
case SERVICE_CONTROL_STOP: ssStatus.dwCurrentState = SERVICE_STOP_PENDING; ServiceStop(); break; // // The rest is the same } David Campeau, P.S: I sent a similar message to George Woltman about a month ago, but I didn't receive any response. Perhap

RE: Mersenne: Milestone!

1999-10-20 Thread david campeau
omputer, use the release form on PrimeNet to release high exponent that you can't complete in 60 Days. and reorder your assignment so that the smallest exponent are finished first. I've been doing this for about 6 months and let me tell you that it's quite tedious, there is NEVER

Mersenne: Re: Mersenne Digest V1 #573

1999-06-11 Thread david campeau
elease any exponent that are over a certain limit (2,025,000 at the moment). When my computer as not enough work queued I just raise my limit. That way I know that exponent are done in a timely manner and they won't be re-re-assign to someone who is going to "sit on it". of cours

Mersenne: LLL

1999-05-12 Thread david campeau
I don`t know what is going on, but LLL as about 6000 exponnent reserved and it`is still asking for more! If this continue for the night there should not be any exponnent available this morning. David, P.S. current number of exponents available 5351 (5AM UTC) _

Re: Mersenne: Re: Is bug a hoax?

1999-04-04 Thread david campeau
weeks in case something like that happens again. regards, David Campeau Get Your Private, Free Email at http://www.hotmail.com Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm

Re: Mersenne: How to factor further?

1999-03-19 Thread david campeau
> >I got the idea to do some factoring with my now slower-than-average >machine (a P133), but I don't want to factor at the current assignments >(in the 9M range); instead I would like to fill up the factor limits of >small exponents to some common value (56 bits or 58 bits or so). > >Of course, d

Re: Mersenne: Spontaneous account change

1999-03-14 Thread david campeau
> >This happened to me too yesterday. The FAQ on www.entropia.com >mentions this spontaneous-account-changing as a phenomenon that can >happen to Prime95/98/NT, but I'm running under Linux. > This is all the work done, submissioned by the Prime95 client, starting on March 13 19:00. I've removed

Mersenne: Prize

1999-02-13 Thread david campeau
there is no more prize. 3) somebody as won the previous prize !!! David Campeau, __ Get Your Private, Free Email at http://www.hotmail.com

Mersenne: Mersenne : Factor probability

1998-10-04 Thread david campeau
Hi, I only have a small question, I think it was mentioned on the list once or twice but I can't find it. I was wandering how to calculate the probability to find a factor, of a mersenne number, in a giving range? what's the probability of finding a factor of M(p) between 2^n and 2^(n+1) ? T