Menu #1
Main page How GIMPS works Download software Frequently Asked Questions Speed of various CPUs Prizes you could win! Search status Top producers PrimeNet statistics
Marin Mersenne
filler
GIMPS
Prime Search
10 World Records

Choose Exponents to Test!

Dot
2^P-1
filler
Menu #2
History The math behind GIMPS Source code Join a mailing list Manual testing Credits Links Send e-mail Other computing projects
September 2006: New Mersenne Prime!
Dot

This page lets you choose an exponent to run a primality tests on. It is easier for me if you use the PrimeNet server's web pages to get exponents and report results, but if you are not comfortable using those pages I am more than happy to work with you by e-mail.

If you are very lucky, you could be the one to find a world record prime number! However, these exponents take quite a while to test. A 2 GHz Pentium 4 computer requires 44 days to test a single exponent! See the benchmarks page for an estimate of how long it will take to test an exponent on your machine. See later sections for work suitable for slower machines.

Now that you've decided you have the patience to run a first-time primality test, pick one of the exponents below and email your choice so that I can remove it from the list and prevent someone else from testing the exponent. For Intel-compatible PCs, create a worktodo.ini file that contains one of the lines exactly as it appears below. For UNIX and PowerMac users, select an exponent below and follow the instructions that came with your program. When your test completes, e-mail the results.txt file to me and select another exponent.

Available below are some 10,000,000 digit numbers for first time testing.

Test=40003213,68
Test=43000063,68
Test=43000081,68
Test=43000093,68
Test=43000121,68
Test=43000147,68
Test=43000183,68
Test=43000201,68
Test=43000213,68
Test=43000231,68
Test=43000241,68
Test=43000393,68
Test=43000459,68
Test=43000523,68
Test=43000561,68
Test=43000589,68
Test=43000709,68
Test=43000721,68
Test=43000897,68
Test=43001027,68
Test=43001039,68
Test=43001081,68
Test=43001117,68
Test=43001137,68
Test=43001159,68
Test=43001173,68
Test=43001249,68
Test=43001293,68
Test=43001341,68
Test=43001411,69
Test=43001521,68
Test=43001587,69
Test=43001627,69
Test=43001747,68
Test=43001753,69
Test=43001773,68
Test=43001837,68
Test=43001839,68
Test=43001843,68
Test=43001939,68
Test=43001957,69
Test=43001963,68
Test=43002031,68
Test=43002059,68
Test=43002067,68
Test=43002101,68
Test=43002181,68
Test=43002221,68
Test=43002257,68
Test=43002283,68
Test=43002343,68
Test=43002373,68
Test=43002413,68
Test=43002517,69
Test=43002593,68
Test=43002601,68
Test=43002613,68
Test=43002649,68
Test=43002787,69
Test=43002889,69
Test=43002907,68
Test=43002919,68
Test=43002923,68
Test=43002929,68
Test=43003019,68
Test=43003127,68
Test=43003141,68
Test=43003199,69
Test=43003309,68
Test=43003381,68
Test=43003409,68
Test=43003439,68
Test=43003453,68
Test=43003529,68
Test=43003531,68
Test=43003577,68
Test=43003613,68
Test=43003627,68
Test=43003673,68
Test=43003739,68
Test=43003769,68
Test=43003853,68
Test=43003867,68
Test=43003907,68
Test=43003921,68
Test=43003949,68
Test=43003969,68
Test=43003981,68
Test=43004021,68
Test=43004119,68
Test=43004279,68
Test=43004317,68
Test=43004321,68
Test=43004369,68
Test=43004417,68
Test=43004447,68
Test=43004551,68
Test=43004567,69
Test=43004587,68
Test=43004639,69

Slower machines can be used in double-checking previous Lucas-Lehmer tests. You could find a new Mersenne prime if the previous Lucas-Lehmer test was incorrect. Pick one of the exponents below and email your choice so that I can remove it from the list and prevent someone else from testing the exponent. For Intel-compatible PCs, create a worktodo.ini file that contains one of the lines exactly as it appears below. For UNIX and PowerMac users, select an exponent below and follow the instructions that came with your program. When your test completes, e-mail the results.txt file to me and select another exponent.

DoubleCheck=23100001,67,1
DoubleCheck=23100017,67,1
DoubleCheck=23100089,67,1
DoubleCheck=23100109,67,1

Very slow machines can still help out by doing some preliminary trial factoring. You will NOT find a new prime number doing this work. These assignments types must be retrieved from the Mersenne forums.


Last updated: May 4, 2008

Getting started: Main page | How it works | Download | FAQ | Benchmarks | Prizes
Learning more: History | The math | Source code | Mailing list
Project status: Status | Top producers | PrimeNet
Miscellaneous: Manual testing | Credits | Links | Feedback