20100903, 12:37  #1 
Apr 2010
England
16_{8} Posts 
What will happen?
If it says I'm at 55% then what is that? calculating the number? checking if it's prime?

20100903, 14:14  #2 
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
3×1,423 Posts 
Calculating the number is easy. Finding factors or proving if the number is prime or composite is hard. As for what your computer is actually doing that it's at 55%, I can't tell you without more information. There are a few different tests Prime95 uses: a few short tests of TF (trial factoring) and P1 (another way to find factors, runs a stage 1 and a stage 2) that try to eliminate the number without running the long test: the LL (LucasLehmer) test that proves whether the number is prime or composite. The LL test must run all the way to 100% before the result is known at all. It's not like factoring that can stop any time if it finds a factor.
If you're interested in more about the math and tests behind GIMPS, see http://www.mersenne.org/various/math.php 
20100903, 14:17  #3 
Apr 2010
England
2·7 Posts 
Thanks, this is what it says exactly:
[Worker #1 Sep 3 14:59] Iteration: 27740000 / 49613569 [55.91%]. Per iteration time: 0.096 sec. [Worker #2 Sep 3 15:04] Iteration: 28190000 / 49661327 [56.76%]. Per iteration time: 0.087 sec. Edit after reading webpage: I think I understand how it works and why iterations are mentioned. If a mersenne is supposedly found are there more checks? A traditional odd factor check? Last fiddled with by RichardB on 20100903 at 14:33 
20100903, 15:38  #4  
"Brian"
Jul 2007
The Netherlands
CC6_{16} Posts 
Quote:
Should either number turn out to be prime, you can be sure that your positive result would immediately be checked by at least two independent trusted members of the GIMPS community on fast dedicated hardware. It would still take a few weeks to verify. This testing will simply be a rerun of your own LLtest. You can probably see that looking for factors would be pointless in this situation: if your test was correct there aren't any other than 1 and the mersenne number itself, and testing all possible factors (even though only certain special numbers of the form 2kp+1 can possibly be factors  where p is your exponent) is clearly impossible since the mersenne number being tested is astronomical in size. If the doublechecking LLtests confirm the primality, there is no doubt that the number is prime. 

20100903, 15:55  #5 
Apr 2010
England
2×7 Posts 
Thanks. One more question do we check all the prime exponents? I just ran my own prime finding program from 40000000 to 60000000 (to find my exponents), there are 1000s to check. It seems incredible we've checked all the ones below in the time we have.

20100903, 18:14  #6 
"Kyle"
Feb 2005
Somewhere near M52..
3·5·61 Posts 
No. The numbers being tested are solely for the form 2^p 1, where p is a prime number. We HAVE tested all numbers of this form for values of p close to 21.5 million. However, there is a nearly unfathomable amount of primes not of the form 2^p 1 that have not been tested. In fact, with our methodology, it is not possible to test these numbers. Hope this helps!

20100903, 19:28  #7 
Apr 2010
England
E_{16} Posts 
If we've only done up to 21.5M why is my exponent 49M?

20100903, 19:30  #8  
"Brian"
Jul 2007
The Netherlands
2·3·5·109 Posts 
Quote:
If I understand correctly, then almost all unfactored mersenne numbers with exponent up to around 38 million have been LLtested at least once. After that it's a sliding scale up to the leading edge just under 50 million with some tests completed and some still outstanding. To RichardB: yes, I think it's amazing too that so much has been tested. Clearly the result of a wellorganized project which has been running for some 14 years with thousands of well coordinated volunteers. Though remember that for many mersenne numbers with prime exponents a factor can be quickly found so that a lengthy LLtest is unnecessary. For a large proportion of the mersenne numbers this factor is small and is found almost at once. 

20100903, 19:38  #9  
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
3×1,423 Posts 
Quote:
Quote:
But the task isn't as monumental as it seems, since less than half of the numbers make it through all the factor checks. (see http://www.mersenne.org/primenet/ and compare Range Count, the number of primes in that range, to Composite F, the number with factors) Most of those factors are found within minutes of work. There are also a LOT of CPUs working on it. Yes, there are thousands of numbers to check, but if thousands of CPUs work together, you can finish it in a reasonable time. Since each number is considered separately, this sort of parallelization is trivially easy. Last fiddled with by MiniGeek on 20100903 at 19:39 

20100903, 20:12  #10 
Apr 2010
England
2×7 Posts 
Thanks a lot Mini Geek, BrianE and Primeinator, all my questions have been answered very well :) This community really is incredible.
I'd love to add my new MacBook Pro to the effort (for basic checks only) but I have a problem I wouldn't want to complicate, same forum: http://www.mersenneforum.org/showthr...290#post228290 
20100903, 20:31  #11  
A Sunny Moo
Aug 2007
USA (GMT5)
3·2,083 Posts 
Quote:
One thing to keep in mind, though, when crunching on a laptop: it's imperative that the laptop is positioned properly for optimal cooling, otherwise it can get REALLY hot with the CPU running full tilt for an extended period of time. (This could lead to thermal throttling, which can seriously impact your computer's crunching speedand possibly even make normal operation a little more sluggish.) A couple tips: Leave the laptop lid open. Much of the heat radiates up through the keyboard, so it's better to have that area open rather than have the heat hit the lid and bounce around the laptop's chassis for a while before finally making its way out the bottom. The more airflow under the laptop and behind it, the better. There are expensive cooling pads you can buy to stick your laptop on, but a much cheaper way is to just use a basic cooling rack from your kitchen. Most importantly, make sure that the fan(s) (usually on the back, but sometimes on the sides) are not blocked. And last but not least: I'd recommend that you only crunch when the laptop is plugged in. Otherwise, it will drain the battery a lot faster than normal, which kind of defeats the purpose of running on battery. I believe Prime95 has a built in option that, when enabled, detects when it's running on battery and stops crunching until you plug it back in. Hope this helps! Last fiddled with by mdettweiler on 20100903 at 20:31 Reason: typo 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Which will happen first?  Uncwilly  Lounge  11  20050218 14:41 