Re: Mersenne: The $100,000 award for 10,000,000 digit prime

1999-07-18 Thread Lucas Wiman
> I hate the charity idea only because it seems to me that a "Mersenne > Scholarship Fund" would do much more for our project in many ways: > > 1. We could control where the money goes to a greater extent. > 2. It would allow us to contribute a great deal more mathematics in > general. > 3. More n

Re: Mersenne: The $100,000 award for 10,000,000 digit prime

1999-07-18 Thread poke
10% for George 10% for Scott 10% for Discoverer 10% Charity/Scholarship (The Mersenne Scholarship Fund) 60% divided evenly to everyone who contributed, based on CPU cycles contributed after the last Mersenne prime found. If someone manages to double the speed, it should be assumed that the CPU c

Re: Mersenne: The $100,000 award for 10,000,000 digit prime

1999-07-18 Thread poke
I hate the charity idea only because it seems to me that a "Mersenne Scholarship Fund" would do much more for our project in many ways: 1. We could control where the money goes to a greater extent. 2. It would allow us to contribute a great deal more mathematics in general. 3. More notariety. -

Re: Mersenne: Factoring & LL tests

1999-07-18 Thread Pierre Abbat
On Sun, 18 Jul 1999, Geoffrey Faivre-Malloy wrote: > 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 hav

Re: Mersenne: The $100,000 award for 10,000,000 digit prime

1999-07-18 Thread Peter-Lawrence . Montgomery
> >7) Anyone that makes a mathematical or algorithmic breakthrough that > >speeds up the search process. I'm talking about a doubling in search speed > >not a 1% speedup in assembly code. > > I think that this would be great -- but I seriously doubt that any > improvement will be found. We ca

Re: Mersenne: Setu for Dual processor NT

1999-07-18 Thread Henrik Olsen
On Sun, 18 Jul 1999, Brian J. Beesley wrote: > > Is there any way to set the affinity under NT automatically when a service > > starts up? > > Put "Affinity=n" into prime.ini (where n = 0, 1, 2, ...) This works > for both NTPrime and Prime95/NT. > > If this line isn't there, the processes are s

Re: Mersenne: The $100,000 award for 10,000,000 digit prime

1999-07-18 Thread Colin Percival
At 11:44 AM 18/07/99 -0700, George Woltman wrote: >2) Me. Some would argue that I share some of the credit for any >Mersenne discoveries. Be aware that I will donate any share to charity. I think that giving some to George is a great idea, with one change: Buy him a new computer with some o

Re: Mersenne: Setu for Dual processor NT

1999-07-18 Thread Brian J. Beesley
> Is there any way to set the affinity under NT automatically when a service > starts up? Put "Affinity=n" into prime.ini (where n = 0, 1, 2, ...) This works for both NTPrime and Prime95/NT. If this line isn't there, the processes are scheduled on the first available processor at each timeslic

Mersenne Digest V1 #599

1999-07-18 Thread Mersenne Digest
Mersenne Digest Sunday, July 18 1999 Volume 01 : Number 599 -- Date: Fri, 16 Jul 1999 20:17:26 +0200 From: "Steinar H. Gunderson" <[EMAIL PROTECTED]> Subject: Re: Mersenne: phew On Fri, Jul 16, 1999 at 10:05

Re: Mersenne: Setu for Dual processor NT

1999-07-18 Thread kilfoyle
If you use the affinity option under advanced it will set the CPU number into the ini file for that image. So if you have 2 CPU and two icons (one using the -A1 switch) then the exe image will use the proper affinity as found in the ini file for that icon. regards Michael.. Chip Lynch wrote: >

Re: Mersenne: Factoring & LL tests

1999-07-18 Thread Jud McCranie
At 01:10 PM 7/18/99 -0400, Geoffrey Faivre-Malloy wrote: >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? Multiple precision arithmetic operations do that. +-

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: Meetings (was $100,000...)

1999-07-18 Thread Chip Lynch
> I like the idea of a symposium, I'll bet that colleges would be willing to > host it. In Illinios, we could host it at UIUC (Urbana), ISU (Normal), or > U of C (Chicago). Maybe we should set a number of these up. I would > personally like to meet the GIMPSers in the midwest. Just for comp

Re: Mersenne: Setu for Dual processor NT

1999-07-18 Thread Chip Lynch
> Use the -A switch (see the readme) to configure a separate image of the EXE. > ALso set the affinity (under advanced) when it is running so the processor > preference will be set in the control file (one image per processor). Is there any way to set the affinity under NT automatically when a se

Re: Mersenne: Setu for Dual processor NT

1999-07-18 Thread kilfoyle
Use the -A switch (see the readme) to configure a separate image of the EXE. ALso set the affinity (under advanced) when it is running so the processor preference will be set in the control file (one image per processor). Expect the speed to slow down per instance.. if I run one image it gets .22

Mersenne: Meetings (was $100,000...)

1999-07-18 Thread Lucas Wiman
> Have a party... wouldn't YOU like to meet the other people working with > GIMPS? Frankly, this wouldn't be THAT expensive, and we could even make > it a symposium or something call for papers or research in the area of > computational number theory. I like the idea of a symposium, I'll bet

Re: Mersenne: subtracting 2: error in FAQ

1999-07-18 Thread Henrik Olsen
On Wed, 14 Jul 1999, Lucas Wiman wrote: > All, > I recieved a message pointing out a possible error in my FAQ: > > > Speaking of Q2.6, I've heard that with Crandall's DWT, the subtraction > > 2 step costs nothing at all. It's done automatically within the > > transformation. Try checking this w