mersenneforum.org Report top-5000 primes here
 Register FAQ Search Today's Posts Mark Forums Read

 2008-03-26, 21:36 #2 rogue     "Mark" Apr 2003 Between here and the 25×3×61 Posts 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.
2008-03-26, 22:17   #3
gd_barnes

May 2007
Kansas; USA

26×3×53 Posts

Quote:
 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

Last fiddled with by gd_barnes on 2008-03-26 at 22:19

2008-03-27, 01:07   #4
rogue

"Mark"
Apr 2003
Between here and the

10110111000002 Posts

Quote:
 Originally Posted by gd_barnes Edit: Rogue, can you have Prof. Caldwell add the CRUS project to your prover code? Thanks.
Done

 2008-03-27, 07:45 #5 Jean Penné     May 2004 FRANCE 24·5·7 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^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
2008-03-27, 08:07   #6
gd_barnes

May 2007
Kansas; USA

26·3·53 Posts

Quote:
 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

Last fiddled with by gd_barnes on 2008-03-27 at 08:18

 2008-03-31, 06:09 #7 gd_barnes     May 2007 Kansas; USA 27C016 Posts FINALLY...Sierp base 2 odd-n gets one! 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! Last fiddled with by gd_barnes on 2008-03-31 at 06:10
 2008-03-31, 13:45 #8 Jean Penné     May 2004 FRANCE 24×5×7 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 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
 2008-04-07, 14:26 #9 Jean Penné     May 2004 FRANCE 24×5×7 Posts Riesel Base 2 odd n's 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
2008-04-07, 16:16   #10
gd_barnes

May 2007
Kansas; USA

26·3·53 Posts

Quote:
 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

2008-04-30, 04:06   #11
mdettweiler
A Sunny Moo

Aug 2007
USA (GMT-5)

624910 Posts

Quote:
 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.

Last fiddled with by mdettweiler on 2008-04-30 at 04:25

 Similar Threads Thread Thread Starter Forum Replies Last Post gd_barnes No Prime Left Behind 688 2020-04-24 07:31 gd_barnes No Prime Left Behind 1487 2020-01-06 21:32 Batalov Conjectures 'R Us 10 2013-03-29 01:29 masser Lounge 9 2008-08-27 12:31 jasong jasong 1 2007-06-09 22:51

All times are UTC. The time now is 04:40.

Fri Aug 14 04:40:56 UTC 2020 up 1 day, 1:16, 1 user, load averages: 1.75, 1.54, 1.46