![]() |
|
|
#12 |
|
Feb 2004
France
22·229 Posts |
What would happen if the 10M+ digit prime Mersenne was found by using Glucas or Mlucas, instead of prime95 ?
I'm now doing some experiments with Glucas and Mlucas, measuring their performance and trying to understand and improve their scalability when run multi-threaded (POSIX threads or OpenMP) on a large (16x) NUMA machine. Rather than using a well-known prime Mersenne, I use "manual testing" exponents I got from George. So the probability I find 10M+ with Glucas or with Mlucas is VERY small ! But not null. What would happen then ? Tony |
|
|
|
|
|
#13 | ||
|
Sep 2005
UGent
3C16 Posts |
Quote:
Quote:
|
||
|
|
|
|
|
#14 | |
|
P90 years forever!
Aug 2002
Yeehaw, FL
1D6616 Posts |
Quote:
Thus, you can legally claim the entire $100K. Or, your own moral code might say that you found this as part of the GIMPS community and will abide by its prize rules. |
|
|
|
|
|
|
#15 | |
|
Feb 2004
France
22×229 Posts |
Quote:
But keep in mind that the probability I find a 10M+ digit prime with XLucas is probably less than 1/200,000 ! (But it seemed to me important to discuss of this now. Just in case !) Your opinion ? Tony Last fiddled with by T.Rex on 2006-01-14 at 17:33 |
|
|
|
|
|
|
#16 | |
|
Nov 2003
22×5×373 Posts |
Quote:
Call me a purist snob. I think people should participate out of interest in the subject, and not for a reward. Or rather, the discovery itself and accompanying recognition should be a sufficient reward. |
|
|
|
|
|
|
#17 | |
|
Nov 2003
22·5·373 Posts |
Quote:
I am working on a different, constructive approach. I am up to 820,000 digits. I am using a single 166MhZ PII. The prime P that I have has: P-1 = k * P1 where P1 is a prime > P^1/3 P1 -1 = k1 * P2 where P2 is a prime > P1^1/3 p2 - 1 = k2 * P3 where P3 is a prime > p2^1/3 etc. I am doing this with an ALL INTEGER convolution code. |
|
|
|
|
|
|
#18 | |
|
Jun 2005
2×191 Posts |
Quote:
Drew |
|
|
|
|
|
|
#19 |
|
Feb 2004
France
22·229 Posts |
What is the goal of the GIMPS ?
Find new Mersenne primes. Break records. "Make Math History". Not get money. What is the goal of the prize ? Drive more people to Mathematics and to Number Theory and "contribute to solving huge scientific problems involving massive computation". If the rules would give all the money to the GIMPS Project and to people who have written the extraordinary programs that enable us to prove prime a Mersenne number, I'm not sure so many people would have joined the project last year. We will have a real idea of the impact of the prize to GIMPS contributors once the 10M+ prime is found, when people will see that testing a Mersenne number around 100M+ digits requires about 7 years of computation, 7/7 24/24 with a fast Pentium4 3.8 GHz, and that thus we will have to wait more than 10 years before reaching the next $150,000 EFF prize seems possible. So, since the 10M+ prime will be a unique event in a decade, we should prepare our-selves to promote this news really widely. As an example, the NewYorkTimes talked about M42. Not about M43. Though I've tried to warn them 3 or 4 times. Tony |
|
|
|
|
|
#20 | |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
10,753 Posts |
Quote:
My views on prize money for achievements in computational number theory are well documented in easily obtainable sources, including the Mersenne forum. It's a rather interesting irony that I've won prize money from competitions for which you did the work for your previous employers. Paul |
|
|
|
|
|
|
#21 |
|
May 2003
7·13·17 Posts |
While I didn't join GIMPS for any prize money, I can definitely say that the settings I put on the program were motivated by prize money (i.e. the setting is *not* "do what makes the most sense for your computer").
Personally, I like the way George is distributing the money if he wins. Maybe a little less could go to the finder of the 10 million digit prime, and the extra could go to future finders. Once a 10 million digit prime is found (whether here or elsewhere) I will probably start running a different program (like 17 or Bust, or Odd Perfect stuff). Last fiddled with by Zeta-Flux on 2006-01-14 at 21:46 |
|
|
|
|
|
#22 | |
|
Dec 2003
Hopefully Near M48
2·3·293 Posts |
Quote:
|
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| mfaktc and sub 100k exponents | Gordon | GPU Computing | 1 | 2016-02-24 04:52 |
| so who got the $25,000 cut of the $100k EFF prize? | ixfd64 | Lounge | 10 | 2012-09-22 15:55 |
| Why is lanczos hard to distribute? | Christenson | Factoring | 39 | 2011-04-08 09:44 |
| A new termination below 100k | 10metreh | Aliquot Sequences | 0 | 2010-03-11 18:24 |
| PRP (Riesel to 100k): Reserve a range | axn | Sierpinski/Riesel Base 5 | 1 | 2006-08-01 20:07 |