Report top-5000 primes here

[gd_barnes]

Please report all top-5000 primes in this thread.

Instructions for submitting a top-5000 prime:

Step 1: For people who have not submitted top-5000 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 proof-code', 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 free-form box. Type in your prime (no spaces needed) and click 'Press here to submit these prime(s)'.
5. If necessary in the little pop-up 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 top-5000 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 k-value 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

[rogue]

288*13^109217-1 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.

[gd_barnes]

Originally Posted by rogue

288*13^109217-1 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.

This is HUGE!! Way to go!! Our first full proof of a conjecture since we started the project! And our first top-5000 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

[rogue]

Originally Posted by gd_barnes

Edit: Rogue, can you have Prof. Caldwell add the CRUS project to your prover code? Thanks.

Done

[Jean Penné]

Happy days for Conjectures'Rus project!
Congratulations to Mark for the first conjecture demonstrated!!

This morning, I found also a success :

173226*2^356966-1 is prime! Time : 520.420 sec.

So, k = 86613 is eliminated, and 15 k's are remaining for proving the Liskovets-Gallot 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

[gd_barnes]

Originally Posted by Jean Penné

Happy days for Conjectures'Rus project!
Congratulations to Mark for the first conjecture demonstrated!!

This morning, I found also a success :

173226*2^356966-1 is prime! Time : 520.420 sec.

So, k = 86613 is eliminated, and 15 k's are remaining for proving the Liskovets-Gallot 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

Congrats Jean! It's nice to get a couple of top-5000 primes for the project after a lull for a little while. That's also the first one for the Liskovets-Gallot conjecures for our project. The remaining 7 k's on the Sierp odd-n 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

[gd_barnes]

After a LONG lull between primes on Sierp base 2 odd-n:

80463*2^468141+1 is prime!

Now at n=471K on all k's.

6 k's to go!

[Jean Penné]

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 sub-projects will become a lot faster!

Please, Karsten would you credit yourself, (instead of me) for the two primes you discovered!

Best Regards,
Jean

[Jean Penné]

As reported in another thread :
145257*2^443077-1 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

[gd_barnes]

Originally Posted by Jean Penné

145257*2^443077-1 is prime! Time : 856.416 sec.

Now 11 k's are remaining, and still another top 5000 prime for the project!

Regards,
Jean

Great work Jean!

We're now making nice progress on the Riesel even-n and odd-n conjectures.

I should be at n=500K on Sierp odd-n by mid-week.

Gary

[mdettweiler]

Originally Posted by gd_barnes

7. In the space below all the programs, type in 'CRUS' for the project, your sieving software (srsieve for team drives), and other software that helped find the prime. Separate each selections by a comma. (Note if you used LLR to find a probable prime and then PFGW to prove the prime, select OpenPFGW at the top and then type in LLR as additional software at the bottom. Each program will get half credit.)

I just noticed this part in the first post of this thread, where it instructs users to credit their primes as LLR and PFGW for top-5000 primes on a non-power-of-2 base. Actually, because LLR's code for non-k*2^n+-1 numbers is taken directly from PRP, users should enter "PRP" under additional software, not LLR, if LLR only found a probable prime. In fact, LLR will instruct users to do so with a note in the lresults.txt file--it will say "such-and-such is a probable prime. Please credit George Woltman's PRP for this result!". Also, according to the top-5000 site, when you list multiple programs in a prover-code, they all get full credit, not half credit as this thread says--this is done to encourage reporting of all programs involved.

So, I fixed it just now to reflect this--hope nobody minds.