RE: Mersenne: GIMPS in Science News

2000-03-30 Thread Geoffrey Faivre-Malloy
> The main reason I’ve heard for people liking the Seti project is > because the screen saver looks pretty. I've been thinking about this for about a month now and I really think it's time for Prime95 to get a facelift. Now, I was thinking just along the lines of having a better GUI. I.E. Have

RE: Mersenne: The recent popularity of Factoring

2000-03-27 Thread Geoffrey Faivre-Malloy
> There is a point there, but I'm sure there are a few folks who just enjoy > the thrill of finding a factor. There is, we must admit, a pleasure of > discovery to seeing > > "Mxxx has a factor: yyy" several times a month that is > utterly absent from seeing > > "Mxxx is

RE: Mersenne: The recent popularity of Factoring

2000-03-27 Thread Geoffrey Faivre-Malloy
> Just so we know, how long would it take a 1.5 Ghz Athlon to factor 100 > assignments through 64 bits? In view of Moore's Law, that's > about what we > should figure on. Well, my PII 500mhz can factor 1 number per day to 64 bits. So, it could probably do 100 in 30 days or so... G-Man ___

RE: Mersenne: The recent popularity of Factoring

2000-03-26 Thread Geoffrey Faivre-Malloy
> I appologize for the misunderstanding. The reason I was upset was not > because you used ten machines to do factoring. Even two hundred machines > doing factoring would not have changed the overall balance of > GIMPS much. > At the time of my message, I thought that you had deliberately gotten

RE: Mersenne: The recent popularity of Factoring

2000-03-26 Thread Geoffrey Faivre-Malloy
> Thanks for "coming clean". Hehehe...I was having fun while it lasted :) > I'd call it an "unwanted feature". George, I think perhaps the easy > way to handle this would be to check "UsePrimeNet" and refuse to > execute AdvancedFactor assignments if UsePrimeNet=1. I wouldn't say that it's an u

RE: Mersenne: The recent popularity of Factoring

2000-03-25 Thread Geoffrey Faivre-Malloy
> I would suggest that, if this person wants to climb the regular list, he > switch to double-checking, switching over two or three machines a > day. This > would gain him credit twice as fast /and/ he would still climb in the > rankings daily, or very nearly so. Why? That's what's great about

RE: Mersenne: The recent popularity of Factoring

2000-03-25 Thread Geoffrey Faivre-Malloy
> I would urge the user concerned to report what happened and also to > take any steps neccessary to prevent a repetition. I'd suggest > halving the "days of work" value as a first step. The problem was caused by me testing the FactorOverride option and setting it to an abusrdly low value (56).

RE: Mersenne: The recent popularity of Factoring

2000-03-25 Thread Geoffrey Faivre-Malloy
Yup. Woops. My apologies to all about reserving so many exponents. G-Man > -Original Message- > From: George Woltman [mailto:[EMAIL PROTECTED]] > Sent: Saturday, March 25, 2000 4:56 PM > To: David Campeau; [EMAIL PROTECTED]; [EMAIL PROTECTED]; Scott Kurowski; > [EMAIL PROTECTED] > Subj

RE: Mersenne: V20 beta

2000-03-17 Thread Geoffrey Faivre-Malloy
I just upgraded and am now getting an 2250 error when attempting to contact the primenet servers. Am I doing something wrong??? G-Man _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- htt

RE: Mersenne: V20 beta

2000-03-17 Thread Geoffrey Faivre-Malloy
> 1) The program now does some P-1 factoring prior to running first time > and double-checking Lucas-Lehmer tests. This will increase overall > GIMPS throughput. If you install version 20 in the middle Does this mean that the exponent's that we've already done factoring on will be re

RE: Mersenne: Re: The return of poaching

2000-02-06 Thread Geoffrey Faivre-Malloy
> I'm an impatient person in a way. I like my exponents finished in a few Me too :) That's why I factor. I've got about 8 machines factoring (from PII 266 all the way up to PIII 500). Still...someone has managed to push me down to number 4 on the factoring top 100. I'll catch up though! :)

Mersenne: Testers needed

1999-11-09 Thread Geoffrey Faivre-Malloy
After much anticipation and delay (well, maybe not anticipated because I didn't tell many people about it), Prime95Setup is available. If you'd like to take a few minutes and help test it and make comments/suggestions, I'd appreciate it. You can download it (for now) at: http://www.mindspring.c

RE: Mersenne: complaint

1999-09-14 Thread Geoffrey Faivre-Malloy
Hopefully we'll announce Prime95 v19 to winfiles.com and other sites as soon as it's out of beta... > 4. People don't know about it. There's a surge of new recruits every > time we get more publicity but it then dies down. _ Unsubsc

RE: Mersenne: Stepping out on a limb here

1999-07-27 Thread Geoffrey Faivre-Malloy
> I hope that this does not read like a flaming response. I have never seen > anything > that I could call "easy" in any aspect of modular forms, functions, > automorphic functions, > elliptic (and other algebraic) curves, or any of the other > supporting struts Nah, not a flame at all :) Isn't

RE: Mersenne: Stepping out on a limb here

1999-07-25 Thread Geoffrey Faivre-Malloy
A couple of minor corrections :) Taniyama-Shimura has only been proven for all semistable cases. And the book is Fermat's Enigma NOT Fermat's Last Theorem as I said :) G-Man _ Unsubscribe & list info -- http://www.scruz.net/~luke/

Mersenne: Stepping out on a limb here

1999-07-25 Thread Geoffrey Faivre-Malloy
I'm rather new to much of the theory behind all of this so have mercy :) I just finished reading Fermat's Last Theorem which is a fascinating book. This introduced me to the Taniyama-Shimura conjecture and subsequent theorem. I've noticed that there are algorithms based on Elliptic Curves. The T

Mersenne: Factoring & LL tests

1999-07-18 Thread Geoffrey Faivre-Malloy
I was reading Fermat's Enigma today and something occurred to me...would it be possible to work with a number quicker if we used a higher base? I.E. Use base 32 instead of base 10? Thus, you're doing less math. Of course, this would have to be in software because the floats can't be in that bas

RE: Mersenne: re: Mersenne prime exponent binary representations and 1's frequency (incl M38)

1999-07-12 Thread Geoffrey Faivre-Malloy
Here's a link... http://www.newscientist.com/ns/19990710/thepowerof.html > -Original Message- > From: [EMAIL PROTECTED] > [mailto:[EMAIL PROTECTED]]On Behalf Of Jud > McCranie > Sent: Monday, July 12, 1999 1:25 PM > To: Chip Lynch > Cc: [EMAIL PROTECTED] > Subject: Re: Mersenne: re: Mers

Mersenne: Estimates to finishing up to 20500000???

1999-07-04 Thread Geoffrey Faivre-Malloy
Has anyone calculated (given the current rate of growth) how long it will take to do 1st level LL tests up to 20 million? G-Man Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm

Mersenne: Prime95 and speed

1999-07-03 Thread Geoffrey Faivre-Malloy
Has anyone else noticed Prime95 executing at twice the speed while factoring then slowing down when it gets to a certain point in the factoring process? Let me clarify a bit more...I have a PII500 that while working on a factor for M9899041 does about .050 seconds per iteration. I've noticed that

Mersenne: Statistics

1999-06-27 Thread Geoffrey Faivre-Malloy
There used to be a web site that showed top 100 type statistics and allowed searching on the primenet results. Does anyone have that link? G-Man Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm

Mersenne: A few questions

1999-06-27 Thread Geoffrey Faivre-Malloy
How large will the exponent be for a 10,000,000 digit prime number? Has the prime number that was found a week ago been announced on this list? I.E. What number was it? Slovinski used to test huge numbers of primes...is he still doing that? G-Man

Mersenne: Another factor found for Fermat 16

1999-06-26 Thread Geoffrey Faivre-Malloy
I found another factor for Fermat 16. What do I do now? How can I factor this number that I found? Are there programs out there that will let me do that? FYI, the factor is: M16384 has a factor: 3178457030898592746194675570663374420833971377365687459461386297851584459031 807318037485960484782