20071224, 03:34  #1 
May 2007
Kansas; USA
17·619 Posts 
Report top5000 primes here
Please report all top5000 primes in this thread.
Instructions for submitting a top5000 prime: Step 1: For people who have not submitted top5000 primes previously, create a prover account: 1. Go to https://primes.utm.edu/bios/newprover.php. 2. Fill out the form and submit it. You will be assigned a prover account. Step 2: Create a proof code: 1. Go to https://primes.utm.edu/bios/newcode.php. 2. Type in your name that you created in step 1 in the space provided. 3. In the list of proof programs, select the program that you used to PROVE the prime (not a probable prime). Usually it will be Jean Penne's LLR or OpenPFGW. 4. In the space below all of the proof programs that says "none", type in 'CRUS' for the project, your sieving software (srsieve for team drives), and other software that helped find the prime. Separate each selection by a comma. (Note if you used LLR to find a probable prime and then PFGW to prove the prime, select OpenPFGW in the selection list and then type in LLR as additional software at the bottom. Each program will get full credit.) 5. You should now have a new proof code and can submit the prime. Example...L442. Step 3: Submit the prime: 1. Go to https://primes.utm.edu/bios/index.php. 2. Next to 'search for proofcode', type your new code from step 2 and press enter. 3. Towards the bottom, next to 'Submit primes using this code as', click on your name (prover account) and press enter. 4. You should see a big freeform box. Type in your prime (no spaces needed) and click 'Press here to submit these prime(s)'. 5. If necessary in the little popup box, type in your user name (prover account) and password and press enter. 6. A verification screen will come up. If the prime is correct, click 'Press here to complete submission'. Suggestion: I suggest attempting to "normalize" or "reduce" your prime as much as possible before submitting although it is not necessary. The top5000 site will do this automatically with its 'canonization' process but it will give you a strange message that is difficult to comprehend. A normalization or reduction can be done all of the time if the base is a power of 2 or the kvalue is a multiple of the base after reducing the base as much as possible. Example: 13438*16^98815+1 13438*2^395260+1 6719*2^395261+1 Gary Last fiddled with by gd_barnes on 20210904 at 20:59 Reason: udpate 
20080326, 21:36  #2 
"Mark"
Apr 2003
Between here and the
1921_{16} Posts 
288*13^1092171 is prime!!!
This proves that 302 is the lowest Riesel k for base 13. BTW, it was found with Phil Carmody's phrot program on PPC and proved with PFGW. 
20080326, 22:17  #3  
May 2007
Kansas; USA
17×619 Posts 
Quote:
This is HUGE!! Way to go!! Our first full proof of a conjecture since we started the project! And our first top5000 prime that is not a power of 2! I'll post it in the news and quickly update the web pages. Edit: Rogue, can you have Prof. Caldwell add the CRUS project to your prover code? Thanks. Gary Last fiddled with by gd_barnes on 20080326 at 22:19 

20080327, 01:07  #4 
"Mark"
Apr 2003
Between here and the
1921_{16} Posts 

20080327, 07:45  #5 
May 2004
FRANCE
2^{2}×5×29 Posts 
Riesel base 2 odd n's : k = 86613 eliminated!
Happy days for Conjectures'Rus project!
Congratulations to Mark for the first conjecture demonstrated!! This morning, I found also a success : 173226*2^3569661 is prime! Time : 520.420 sec. So, k = 86613 is eliminated, and 15 k's are remaining for proving the LiskovetsGallot conjecure for Riesel odd n's! This is also a top 5000 prime, so I am waiting for a project code. Reseving now k = 290514 in place of this died k! Regards, Jean 
20080327, 08:07  #6  
May 2007
Kansas; USA
17×619 Posts 
Quote:
Congrats Jean! It's nice to get a couple of top5000 primes for the project after a lull for a little while. That's also the first one for the LiskovetsGallot conjecures for our project. The remaining 7 k's on the Sierp oddn are being stubborn now with no primes since n=~299K. Testing is now past n=460K on all k's. The project code is CRUS. Gary Last fiddled with by gd_barnes on 20080327 at 08:18 

20080331, 06:09  #7 
May 2007
Kansas; USA
17·619 Posts 
FINALLY...Sierp base 2 oddn gets one!
After a LONG lull between primes on Sierp base 2 oddn:
80463*2^468141+1 is prime! Now at n=471K on all k's. 6 k's to go! Last fiddled with by gd_barnes on 20080331 at 06:10 
20080331, 13:45  #8 
May 2004
FRANCE
2^{2}·5·29 Posts 
Very nice results!
Many congrats, Gary and Karsten, for these last three primes, there are very nice results, because 1 k is eliminated for Sierpinski base 2 odd n's and 2 k's are eliminated for Riesel base 2 odd n's.
Moreover, the big sievings I started for these two subprojects will become a lot faster! Please, Karsten would you credit yourself, (instead of me) for the two primes you discovered! Best Regards, Jean 
20080407, 14:26  #9 
May 2004
FRANCE
2^{2}·5·29 Posts 
Riesel Base 2 odd n's
As reported in another thread :
145257*2^4430771 is prime! Time : 856.416 sec. Now 11 k's are remaining, and still another top 5000 prime for the project! k = 148323 is now at n = 508511, no prime, continuing... Regards, Jean 
20080407, 16:16  #10  
May 2007
Kansas; USA
10523_{10} Posts 
Quote:
Great work Jean! We're now making nice progress on the Riesel evenn and oddn conjectures. I should be at n=500K on Sierp oddn by midweek. Gary 

20080430, 04:06  #11  
A Sunny Moo
Aug 2007
USA (GMT5)
14151_{8} Posts 
Quote:
So, I fixed it just now to reflect thishope nobody minds. Last fiddled with by mdettweiler on 20080430 at 04:25 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Report top5000 primes for all k<=1001  gd_barnes  No Prime Left Behind  1524  20211021 22:57 
Report top5000 primes for k=10033000  gd_barnes  No Prime Left Behind  688  20200424 07:31 
All top 5000 primes will have the same number of digits in 2014 ;)  Batalov  Conjectures 'R Us  10  20130329 01:29 
Twenty Oldest Primes on Top 5000 List  masser  Lounge  9  20080827 12:31 
get all the 5000 biggest primes above 100K digits  jasong  jasong  1  20070609 22:51 