![]() |
|
|
#1 |
|
Dec 2017
F016 Posts |
Hi all,
10 years ago I tried to find a mersenne prime using Gimps on my slow computer. I had no luck. Well now I'm testing a prime number that is a little larger than the one that was found to be the 49th mersenne. Right off the bat it is testing it with Lucas Lemer and it will be completed Jan 8, 2017. My question is are there other tests? What are they? How long will the entire process take if all tests are passed stating its a Mersenne if it is one? Here is my computer specs if you need that to make any calculation. |
|
|
|
|
|
#2 |
|
Aug 2006
3×1,993 Posts |
There are two tests that can discover Mersenne primes: Lucas-Lehmer and the Gerbicz PRP test. Only the former can prove their primality, but that's just a formality -- once discovered with either test candidates need to be checked with LL on a number of different systems.
The other tests, trial division and P-1, support these main tests by weeding out composite candidates to reduce wasted effort. |
|
|
|
|
|
#3 | |
|
Dec 2017
24×3×5 Posts |
Quote:
|
|
|
|
|
|
|
#4 |
|
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
which version of the software is being used also matters potentially.
|
|
|
|
|
|
#5 |
|
Dec 2017
24·3·5 Posts |
|
|
|
|
|
|
#6 |
|
"Forget I exist"
Jul 2009
Dumbassville
100000110000002 Posts |
there may be software timings for that hardware,that may help you figure it out, though I don't know the link. found the listings: https://www.mersenne.org/report_benc...ic_cpu=4374623 is the closest I found in the data myself. of course you can just multiply average ms per iteration by iterations and get a very very rough result.
Last fiddled with by science_man_88 on 2017-12-22 at 01:07 |
|
|
|
|
|
#7 |
|
"Victor de Hollander"
Aug 2011
the Netherlands
23×3×72 Posts |
In Prime95, go to Test---> Status
There should be an estimated completion date there. Other option is to login on mersenne.org and check your current assignments there. It could take a few days to get a good estimate, depending on your PCs uptime/time P95 is allowed to run. |
|
|
|
|
|
#8 | |
|
Dec 2017
24·3·5 Posts |
Quote:
|
|
|
|
|
|
|
#9 | |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
2×19×163 Posts |
Quote:
However usually tests on exponents in the 70-80 million range will be from a few days to a few months. The time greatly depends upon your system specs and how you configured P95, plus lots of other factors like whether your system runs 24/7 and if other processes are using CPU cycles and/or memory swapping etc. Also note that the estimated completion times will change during the test, sometimes by a lot, and they usually move further into the future as it progresses. After the test is finished someone else will verify the result later. You can move on to another test and try again with a new exponent. Last fiddled with by retina on 2017-12-22 at 03:06 |
|
|
|
|
|
|
#10 |
|
Jun 2005
USA, IL
193 Posts |
The Lucas-Lehmer (LL) test your machine is running is the only test your machine will need to run in order to determine if your candidate prime number is a Mersenne prime. That type of test gives a specific Yes/No result. Don't be discouraged, but the likely result will be that your candidate prime number is not a Mersenne prime, but it certainly could be.
The test will likely complete sometime around the estimated date. Tests can run longer if the machine spends any time doing other work, but if you do decide to test additional candidate numbers after your current candidate number, you'll probably get a good idea of how long your machine will take for each result for numbers around the same size. Last fiddled with by potonono on 2017-12-22 at 03:08 |
|
|
|
|
|
#11 | |
|
Dec 2017
24×3×5 Posts |
Quote:
|
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Modifying the Lucas Lehmer Primality Test into a fast test of nothing | Trilo | Miscellaneous Math | 25 | 2018-03-11 23:20 |
| New PC test re-test plan? | dh1 | Information & Answers | 8 | 2015-12-11 11:50 |
| Double check LL test faster than first run test | lidocorc | Software | 3 | 2008-12-03 15:12 |
| Will the torture test, test ALL available memory? | swinster | Software | 2 | 2007-12-01 17:54 |
| A primality test for Fermat numbers faster than Pépin's test ? | T.Rex | Math | 0 | 2004-10-26 21:37 |