![]() |
![]() |
#34 | |
May 2004
FRANCE
24C16 Posts |
![]() Quote:
But, indeed, I cannot continue to have 32 k's reserved, I have not computer power enough for that! For now, I will try to continue to test the -1, odd n's up to 256K base 2 ( n <= 262144), so I will now unreserve : k = 9519 (even n's, tested now up to n = 581680, no prime...) (This is now a top 5000 candidate!) and for odd n's : k = 6927, 8367, 30003, 39687, 172167 (no prime, tested as you showed). Best Regards, Jean |
|
![]() |
![]() |
![]() |
#35 |
Mar 2006
Germany
295110 Posts |
![]()
oh, i was a little to quick to try. don't know you want to continue the odd-1 search while i inserted your gathered results.
after half a day run (sieve and test) i found: 53973*2^198575-1 is prime! (only this k tested) so one candidate less to search for you. sorry. i marked all other k's as reserved by you for odd-1. do you have sieve-files for the other k's for me to test further? now this page is available under www.rieselprime.de/Related/LiskovetsGallot.htm or use www.rieselprime.de -> left menu -> 'Others Projects' there. Last fiddled with by gd_barnes on 2009-12-24 at 07:36 |
![]() |
![]() |
![]() |
#36 | |
May 2004
FRANCE
22·3·72 Posts |
![]() Quote:
No problem! Congrats for finding this prime! My goal is presently to eliminate the "easy" k's (those which would not yield a top 5000 prime) as fast as possible. I also found 2 primes : 48927 35861 --> 97854*2^35860-1 is prime! Time : 4.610 sec. 59655 43825 --> 119310*2^43824-1 is prime! Time : 8.195 sec. so, I am encouraged to continue! I have no sieved file for n > 256K base 2 presently... Regards, Jean Last fiddled with by gd_barnes on 2009-12-24 at 07:38 |
|
![]() |
![]() |
![]() |
#37 |
May 2007
Kansas; USA
22×52×107 Posts |
![]()
I have now tested the Sierp odd-n conjecture to n=200K. No primes were found since my last post. So here are the 9 k's remaining:
Code:
k test limit 9267 1967862 32247 1780000 (per Sierp base 4 mini-drive at CRUS) 37953 200K 53133 200K 60357 200K 70467 200K 80463 200K 84363 200K 85287 200K I am now sieving the k's remaining for n=200K-600K. Gary Last fiddled with by gd_barnes on 2008-01-22 at 04:15 |
![]() |
![]() |
![]() |
#38 |
May 2004
FRANCE
22·3·72 Posts |
![]()
Two more primes on Riesel odd n's :
79437 35093 158874*2^35092-1 is prime! Time : 5.142 sec. 114249 48469 228498*2^48468-1 is prime! Time : 9.130 sec. 26 remaining for now, continuing! Jean |
![]() |
![]() |
![]() |
#39 |
May 2004
FRANCE
11148 Posts |
![]()
46923 65175 93846*2^65174-1 is prime! Time : 27.638 sec.
75363 120595 150726*2^120594-1 is prime! Time : 112.778 sec. 75873 62419 151746*2^62418-1 is prime! Time : 26.485 sec. Now 23 k's remaining! Jean |
![]() |
![]() |
![]() |
#40 |
Mar 2006
Germany
13×227 Posts |
![]()
great work, Jean. go!
3 more steps closer to the proof! and ... woooshhhh... results online! |
![]() |
![]() |
![]() |
#41 |
May 2007
Kansas; USA
22×52×107 Posts |
![]()
Karsten,
I'm doing some double-checks up to n=10K and then n=25K on all of the base 2 even-n and odd-n conjectures before incorporating them in my web pages. So far I've checked Riesel odd-n and Sierp odd-n. For Sierp odd-n, the only issues that I found were the n=1 primes already posted here. On Riesel odd-n, I found one error: 84807*2^7389-1 is shown as prime. I found no prime for n<10K for this k so I searched further and found that 84807*2^47389-1 is prime instead. Obviously a missed digit. Thanks, Gary |
![]() |
![]() |
![]() |
#42 |
Mar 2006
Germany
13×227 Posts |
![]()
ok, got it.
Jean's data post #18 contains: 84807 7389 169614*2^47388-1 is prime! Time : 8.790 sec. and i copied only the first 2 numbers without looking behind! fixed it. good to check twice! |
![]() |
![]() |
![]() |
#43 | ||
May 2007
Kansas; USA
22·52·107 Posts |
![]() Quote:
Quote:
Jean and Karsten, Based on the above, I got a little confused because there are differences in this testing shown and what is shown on Karsten's Liskovets-Gallot conjectures web page. My pages are also incorrect due to so many previous posts flying around on these k's for different bases so I am working to correct them. Here is what I think it should be for all related bases: Riesel base 2 even-n: k=9519, test limit 581680; now unreserved k=14361, test limit 318510; reserved by Jean k=19401, test limit 262578; reserved by Jean k=20049, test limit 265144; reserved by Jean Riesel base 4: k=9519, test limit 290840; now unreserved k=14361, test limit 159255; reserved by Jean k=19401, test limit 131289; reserved by Jean k=20049, test limit 132572; reserved by Jean Riesel base 16: k=9519, test limit 145420; now unreserved k=20049, test limit 66286; reserved by Jean (k=14361 and 19401 are trivial base 16) Karsten, Can you correct your Liskovets-Gallot conjectures web page for the above test limits and reservations? Also, are you now working on any of these k's instead of Jean? Thanks, Gary Last fiddled with by gd_barnes on 2008-01-24 at 08:30 |
||
![]() |
![]() |
![]() |
#44 |
May 2007
Kansas; USA
247148 Posts |
![]()
Karsten and Jean,
There are 3 more k's for Riesel base 2 ODD-n, base 4, and base 16 that I need to confirm statuses, reservations, and test limits. Here is what I show for k=13854, 16734, and 19464 and their coharts for Riesel base 2 odd-n k=6927 and 8367: Riesel base 2 odd-n: k=6927, test limit 261945; now unreserved k=8367, test limit 262045; now unreserved Riesel base 4: k=13854, test limit 130972; now unreserved k=16734; test limit 131022; now unreserved k=19464; test limit ??; reserved by Jean Riesel base 16: k=13854, test limit 100000; now unreserved (I tested this one separately to n=100000 since we had a sieved file for it. Odd n's would still need testing separately up to n=200000 base 4) k=16734, test limit 66511; now unreserved k=19464, test limit ??; reserved by Jean Can one or both of you verify that the above is correct? My main question is for Jean: What is your test limit on k=19464? There was an original post that stated n=93672 base 4. And then a later post that stated n=137000 base 2. Since the later post was a lower range, I've become confused. Note that all of this is coming about since I'm now incorporating the base 2 even-n and odd-n conjectures into my web pages. Thanks, Gary Last fiddled with by gd_barnes on 2008-01-24 at 18:20 Reason: Jasong unreserved Riesel base 2 odd-n k=8367 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Bases 501-1030 reservations/statuses/primes | KEP | Conjectures 'R Us | 4084 | 2022-05-15 06:34 |
Bases 251-500 reservations/statuses/primes | gd_barnes | Conjectures 'R Us | 2413 | 2022-05-09 20:14 |
Bases 101-250 reservations/statuses/primes | gd_barnes | Conjectures 'R Us | 982 | 2022-05-08 22:14 |
Bases 6-32 reservations/statuses/primes | gd_barnes | Conjectures 'R Us | 1416 | 2022-04-24 08:50 |
Bases 33-100 reservations/statuses/primes | Siemelink | Conjectures 'R Us | 1715 | 2022-01-23 14:23 |