On 19 Jul 99, at 18:40, Todd Sauke wrote:
Alex,
The group you seek always has 2^n elements. All bit combinations are
possible.
(P = 2^p-1 is "minus one" in n-bit words. 2*P is minus two, etc. up to
2^n*P which is 0. All bit patterns occur.)
Todd Sauke
In general, what you say is
On 19 Jul 99, at 3:57, [EMAIL PROTECTED] wrote:
*) Somebody finds how to parallelize the FFT using little
communication. The wall-clock time might be reduced 10-fold,
but the CPU time increased 16-fold. This could be
great for verifying a new
Now, I'm going to toss out an idea. I thought about this a few minutes
after reading the previous message and I want to see if you all think its
worthwhile or not, or whether its even correct or not.
Here goes:
1) If we know the last n bits of a number x, then we can (easily) determine
the last
Alex,
The group you seek always has 2^n elements. All bit combinations are
possible.
(P = 2^p-1 is "minus one" in n-bit words. 2*P is minus two, etc. up to
2^n*P which is 0. All bit patterns occur.)
Todd Sauke
Now, I'm going to toss out an idea. I thought about this a few minutes
after
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 can't get
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.
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
Hi all,
At the risk of opening Pandora's box, I'd like to bring
up the possibility of splitting up the $100,000 award for a 10 million
digit prime. I'm soliciting everyone's opinion before making a decision.
First off, it is by no means guaranteed that GIMPS will claim the
At 05:32 PM 7/17/99 -0400, George Woltman wrote:
At the risk of opening Pandora's box, I'd like to bring
up the possibility of splitting up the $100,000 award for a 10 million
digit prime.
1/3 to George, or a charity of his choice
1/3 to Scott, or as he wishes, e.g. Entropia.com
1/3 to
George Woltman wrote:
4) The discoverers of any Mersenne primes between now and the 10,000,000
digit discovery. This will encourage an orderly exploration of the exponents
and keep up interest over the coming years.
You have anticipated my idea, George. The EFF awards should have been
Hi all,
At the risk of opening Pandora's box, I'd like to bring
up the possibility of splitting up the $100,000 award for a 10 million
digit prime. I'm soliciting everyone's opinion before making a decision.
I propose we split it like this :
33% to the finder of the first 10,000,000 digit
George Woltman wrote:
Hi all,
At the risk of opening Pandora's box, I'd like to bring
up the possibility of splitting up the $100,000 award for a 10 million
digit prime. I'm soliciting everyone's opinion before making a decision.
1/4 to George or charity (his choice)
1/4 to Scott or
On Sun, 18 Jul 1999, Otto Bruggeman wrote:
I propose we split it like this :
33% to the finder of the first 10,000,000 digit prime,
33% to Scott and George, for doing excellent work
33% to charity, deciding by vote by all the members of gimps, every
doublecheck gives an extra vote over
The EFF of course, is offering the prize to help the advancement of just
this sort of distributed computing (well, in a simplified nutshell). I
don't think anyone should "profit" from GIMPS, but if we were to win a
huge prize, I think we should use the money as it's intended.
The idea of giving
Chip Lynch wrote:
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.
Great idea Chip! I
15 matches
Mail list logo
