Mersenne: Re: Mersenne Digest V1 #1036

2003-01-24 Thread Gordon Spence
From: Richard Woods [EMAIL PROTECTED] Subject: Mersenne: Poaching -- Discouragement thereof Here's what I've just posted in the GIMPS Forum. - - - - _IF_ PrimeNet has automatic time limits on assignments, ordinarily requiring no manual intervention to expire assignments or re-assign them,

Mersenne: Poaching and related issues...

2003-01-24 Thread Nathan Russell
Okay, to start with, GIMPS lost the very first prime we ever found to a member of another project who beat George to finding the exponent by a matter of hours. This is simply the way math and other fields of research work. Darwin's theory of evolution was very nearly duplicated by another

Re: Mersenne: Poaching -- Discouragement thereof

2003-01-24 Thread Brian J. Beesley
On Friday 24 January 2003 02:27, Richard Woods wrote: Let's put it this way: Maybe you don't give a fig for fame, but some of the rest of us do. A chance at real, honest-to-gosh mathematical fame has a value not measurable in CPU years, but poaching steals that. So what we want is a

Mersenne: question not in faq

2003-01-24 Thread Frank Anzalone
Since the list is fairly quiet I will ask this now. If the answer is online somewhere please direct me. If I need m mod n and m is to big for my mod function, I believe I can add a mod n to b mod n provided a+b=m. Is there an easier way? suppose n is to big? Thank you in advance. Frank

Re: Mersenne: question not in faq

2003-01-24 Thread Steinar H. Gunderson
On Fri, Jan 24, 2003 at 06:39:40PM -0500, Frank Anzalone wrote: If I need m mod n and m is to big for my mod function, I believe I can add a mod n to b mod n provided a+b=m. Is there an easier way? suppose n is to big? What do you mean by is too big for your mod function? Usually, in this

Re: Mersenne: Poaching -- Discouragement thereof

2003-01-24 Thread Nathan Russell
--On Friday, January 24, 2003 8:59 PM + Brian J. Beesley [EMAIL PROTECTED] wrote: I think perhaps what may be needed is a new rule that users who don't complete assignments in a reasonable period of time (say 1 year?) should lose the right to the assignment, even if they do check in

Re: Mersenne: Poaching -- Discouragement thereof

2003-01-24 Thread Anurag Garg
I think perhaps what may be needed is a new rule that users who don't complete assignments in a reasonable period of time (say 1 year?) should lose the right to the assignment, even if they do check in regularly. Does this apply to 10M assignments? As George proposed on the GIMPS forums

Re: Mersenne: Poaching -- Discouragement thereof

2003-01-24 Thread John R Pierce
But, no, you won't be able to complete a 10M on a P100 ;-) my slowest machine still on primenet is a p150 that has 60 days to finish 14581247, its been working on it for about 300 days now, 24/7, with nearly zero downtime. 2.22 seconds per iteration, yikes. I probably should retire this box

Mersenne: Communication between GIMPS Forum and Mersenne mailing list (was: Poaching -- Discouragement thereof)

2003-01-24 Thread Richard Woods
Recently I wrote: I asked this in the GIMPS forum, but haven't seen any answer there yet. So will you please point out what I overlooked? ... to which Brian Beesley replied: Sorry, I don't read the forum. It's inconvenient expensive for those of us that have pay-as-you-go dialup

Re: Mersenne: Communication between GIMPS Forum and Mersenne mailing list (was: Poaching -- Discouragement thereof)

2003-01-24 Thread Michael Vang
So Mr. Beesley and anyone else who hadn't read the Forum, whatever their reasons, _didn't yet know that a major Primenet server software change had already been discussed in the recent past and had practically been decided-upon_, because none of that Forum discussion had been reported to the