20141108, 01:09  #1 
"Sastry Karra"
Jul 2009
Bridgewater, NJ (USA)
1B_{16} Posts 
How do I test if it is a mersenne prime on GIMPS?
Hi,
I have a prime number (93886421). I cannot test if it is a Mersenne Prime or not on my computer. I want to submit as a manual assignment on GIMPS website. I made sure that the above number is prime before checking on GIMPS Starting calculation... NUMBER: 93886421 4845 iterations Checked range: 3 > 9691 of 9691 ************************* * This number IS prime! * ************************* I tried to give the range and it is giving me this error: Error code: 40 Error text: No assignment available meeting CPU, program code and work preference requirements, cpu_id: 125173, cpu # = 0, user_id = 19502  Will someone tell me where my mistake was? Thanks, Sastry Karra Last fiddled with by spkarra on 20141108 at 01:12 Reason: adding more information 
20141108, 01:19  #2 
Aug 2002
North San Diego County
13·53 Posts 
Factor found for that exponent PrimeNet entry here.
Last fiddled with by sdbardwick on 20141108 at 01:21 
20141108, 01:51  #3  
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
22534_{8} Posts 
Quote:
However, this is only one prerequisite for even thinking about testing 2^938864211 for primality. The second step is this: does it have small factors? This can be checked in much shorter time than running the primality test, and is always done. GIMPS database stores the old results so that you would not have to repeat them. In this particular case, some one found a factor. 7911153228307378607 divides 2^938864211. Ok? Then the rest is unnecessary to test Steps 3 (a P1 test) and 4 (LL test). It is not prime. Compare your story with small toy stories below: Example 1: I want to test if 2^99999999991 is prime. Step 1. Is 9999999999 prime? No, it is not. 3 divides 9999999999, and because of that 2^31 divides 2^99999999991. End of story. 2^99999999991 is not prime. Example 2: I want to test if 2^111 is prime. Step 1. Is 11 prime? Yes it is. Good, now on to Step 2. Do small numbers (and we know that they must be of type 2*11*k+1, e.g. 23, 67, 89...) divide 2^111? Does 23 divide 2^111? Yes it does. End of story. 2^111 is not prime. 

20141108, 19:51  #4 
May 2013
East. Always East.
3277_{8} Posts 
I have always wondered if the residue at the end of a test could give any insight into the number itself. Does it hold any value or is it random gibberish?
Only if the residue was worth anything would there be any reason at all to run the primality test on a known composite. As for the specific question: You cannot get Primenet to assign that number to you, but if you REALLY want to waste your time testing a known composite, I think you can force Prime95 to run the test anyway without an assignment by manually putting it into your worktodo.txt. Seriously though, don't do it. 
20141108, 22:02  #5  
"Sastry Karra"
Jul 2009
Bridgewater, NJ (USA)
33_{8} Posts 
Quote:
Thanks a lot. 

20141108, 22:04  #6 
"Sastry Karra"
Jul 2009
Bridgewater, NJ (USA)
3^{3} Posts 
Thanks a lot Batalov.
I tried for 93887011.  93887011 is a prime number!  Then I tried for 2^938870111 for primality. I got this:  PrimeNet Exponent Status Exponent Range: to Output results in textonly format Show full details (current assignment, history, LL residues) 93,887,011No factors below270 Assigned20140311ahmeraliTFexpired on 2014051020140510ANONYMOUSTFexpired on 20140709 HistoryDateUserResult20101228For ResearchNFno factor from 2^64 to 2^6520131226sasakiNFno factor from 2^65 to 2^6620140216SMoffatNFno factor from 2^66 to 2^6720140219SMoffatNFno factor from 2^67 to 2^6820140810SMoffatNFno factor from 2^68 to 2^6920140914Ryan PropperNFno factor from 2^69 to 2^70  Thanks, Sastry Karra Last fiddled with by spkarra on 20141108 at 22:12 
20141108, 22:42  #7 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{2}×3×797 Posts 
This one is fine to test, but you still have steps 2, 3 and 4 to do.
Step 2. Small factors are not tested deep enough. (wanted level is 2^74. Makes sense to do all factoring de novo.) Step 3. P1 test has not been run Step 4. LL test has not been run Why are they done in this order? (and why do you not want to skip steps?) Because each step takes more time than the previous. You can reserve this number by starting running it in your own copy of Prime95 that is configured to communicate to the GIMPS server. Your program will communicate and will have it reserved. then you can pause your Prime95 (or you can run it on and off) but start factoring in mfaktc in parallel. If you don't have a graphics card, take some other exponent that already has steps 2 and 3 done. Read the instructions at http://www.mersenne.org/gettingstarted/ and optionally here on the forum (use the search function). 
20141108, 22:43  #8 
May 2013
East. Always East.
1727_{10} Posts 
You can manually reserve this exponent if you wish. First, however, you want to trial factor it. Probably to 74  76 bits. That will take some time, but not nearly as much as running the LL test in its entirety. A modern computer could take several weeks. A notsomodern computer maybe a few months.
Last fiddled with by TheMawn on 20141108 at 22:44 
20141110, 18:22  #9  
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
1011100011011_{2} Posts 
Quote:


20141111, 12:57  #10  
"Sastry Karra"
Jul 2009
Bridgewater, NJ (USA)
27_{10} Posts 
Quote:
Thanks a lot. I will get Prime95 installed on my computer and will try to reserve it. Will update the status soon.... 

20141111, 16:48  #11 
Nov 2003
2^{2}·5·373 Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Ok so now where can I test a huge prime besides gimps  ONeil  Information & Answers  33  20180421 13:55 
New test for Mersenne prime  allasc  Math  33  20110520 22:48 
GIMPS Mersenne prime clients on Solaris?  rx7350  Software  4  20070228 04:05 
another mersenne prime test  jocelynl  Math  8  20061020 19:36 
New Prime Test allows reuse exps (eg GIMPS)?  bearnol  Miscellaneous Math  7  20051020 13:21 