20080525, 08:57  #23  
"Gary"
May 2007
Overland Park, KS
2^{5}×3^{2}×41 Posts 
Quote:
No...you can't just remove ALL k's that are divisible by 3. You'll miss some kvalues that are remaining. They must be divisible by a POWER OF 3 AND reducable to a kvalue that is already remaining. That's because the k divided by a power of 3 may have a prime at ONLY n=1. For example: Let's say that k*3^11 is prime and that is the only known prime for that particular kvalue. Now, let's say that you're searching a kvalue that is 3 times the above kvalue but you fail to find a prime up to n=10K or n=25K or whatever you're searching to. It would be incorrect to automatically remove 3k*3^n1 simply because the k is divisible by 3. We know by the above that 3k*3^01 is prime but n must be >= 1 and we have not found a prime for 3k that fits that condition. One more thing...be sure and reduce the kvalue all the way. Sometimes you may not find that k / 3 is remaining but that k / 3^2 or k / 3^3 or k / 3^4 IS remaining. In any of those cases, your k could be removed. Regardless, removing multiples of the base must be done very carefully. If you are now hesitent to do this, simply attach a spreadsheet of kvalues remaining that are divisible by a power of 3 and I'll verify that they can removed. Well over 90% can usually be removed but if you look on the Sierp base 3 reservations page, you'll find that probably 1015 of them ARE divisible by 3 for just the above reason, simply because k/3 had a prime at only n=1. About what Micha said, it's OK if you leave a kvalue in where we already know a large prime exists, whether it be on top5000 or found by someone in this project. We'll find it eventually. But removing one where there isn't a known prime simply because it is divisible by 3 would be bad. Gary 

20080525, 09:07  #24 
Quasi Admin Thing
May 2005
2×491 Posts 
@Gary: I think given the fact that it really doesn't give that much difference in sieving speed, that I'll just (at least for n<=25,000) keep all the k's remaining and take them all to n<=25,000 simply to avoid mistakes
Thanks for your feedback. Kenneth! 
20080525, 09:25  #25  
"Gary"
May 2007
Overland Park, KS
2^{5}×3^{2}×41 Posts 
Quote:
Gary 

20080525, 18:37  #26  
Quasi Admin Thing
May 2005
2·491 Posts 
Quote:
Thanks. Kenneth! 

20080531, 20:46  #27 
Jan 2006
Hungary
2^{2}·67 Posts 
Riesel base 3
201886*3^391011
301096*3^490501 731636*3^372151 993424*3^252961 1512358*3^637291 1728886*3^322831 are all primes, by way of srsieve > sr1sieve > LLR > PFGW Enjoy, Willem 
20080531, 21:45  #28  
Quasi Admin Thing
May 2005
2·491 Posts 
Quote:
But again great work, hope you can kill the 1,500 primes I'll submit (approximately) or maybe 3,000 k's before removed doubles coming in 4 weeks (maybe 3). In case you run out of work, please feel free to attack the ranges of k's for base 3 riesel with k greater than 1500 M and bring them to 25,000 at first. Actually I think from a sieving point of view, that we would be far better of, if we actually tested the remaining 62.5G k's up to n<=25,000 and then made a combined sieving effort to n<=50,000 since its always faster to sieve more candidates (according to what I've been told way back) than to sieve just part of a range at a time. Also with the few candidates seeming to remaining (less than 250,000) it shouldn't be claiming much on the RAM use. Sieving 50,000 base 3 k's for 25,000 n required on my machine ~163 MB of RAM as of testing of today. So any chance you join me in this combat? Last fiddled with by KEP on 20080531 at 22:16 Reason: Just changed the klimit! 

20080531, 22:18  #29 
Quasi Admin Thing
May 2005
2·491 Posts 
I've now decided to run the Riesel Base 3 up to at least 1.5 G, so in 8 hours please consider this range as in progress aswell. So therefor if you decide to join in the effort, please consider for Riesel Base 3 to do work on k's above k 1,500,000,000.
Thank you. KEP! 
20080601, 05:08  #30  
"Gary"
May 2007
Overland Park, KS
11808_{10} Posts 
Quote:
If you want, take a hack at the Sierp side of things on a few of the smaller 240 k's remaining at n=25K. Quote:
One more thing, k=1816974 is not considered remaining because k=201886 WAS remaining and 201886*3^2=1816974. And now that k=201886 has a prime at n=39101, then k=1816974 has a prime at n=39099. So, I'm confused as to why you say that k=1816974 needs to be checked? It would have been removed from your processing list after you found that k=201886 was still remaining. It's either one or the other but not both, otherwise we end up doing large amounts of duplicate work for n>25K. That is if k=201886 has a prime for n<=2 but k=1816974 has no primes for n>=1, then k=1816974 is remaining. If k=201886 has no prime, then k=201886 is remaining and not k=1816974. Because, as you found, it's easier to search all even k's for n<=25K, we do so even though there is some duplicate work on multiples of the base. It's after we are done with that initial process that we are eliminating multiples of the base in the 9095% of the situations that we can do so. And we do it then because doing duplicate work with long testing times would be extremely inefficient. It's better to take the time to manually remove them as testing times get longer. Gary 

20080601, 07:44  #31 
Quasi Admin Thing
May 2005
1726_{8} Posts 
@Everyone: Due to a loss of interest, and the fact that I would seriously like to get going with one of my older projects, I've decided to bring the Riesel Base 3 k no further than k<=1500M. So to anyone willing to take over the k's above, feel free to start doing so. I will still complete the entire range up to k 1,500,000,000 all the way up to n<=25,000. However this is all expected to be done and completed in at most 4 weeks.
Good luck on processing the remaining k's and remove those k's left. Maybe I check back at later basis, but for now consider that running to be the only one. And of course I will continue on my dual in 4 weeks or so to try and bring down the sierpinski base 19. Regards! KEP! 
20080601, 09:55  #32  
Quasi Admin Thing
May 2005
2×491 Posts 
Quote:
But still good luck folks on bringing down these hard and "easy" conjectures. And who knows maybe see you again in the future. Also Gary, the 18..... k for riesel base 3 with k<=2M was eluded by myself at n<=5000 testing, so even though it remained in the list before I removed it and stoped LLR testing on this candidate because it essentially were the same, no prime will have been missed... sorry if this caused confusion. Regards KEP! 

20080613, 15:59  #33 
Quasi Admin Thing
May 2005
2·491 Posts 
Regarding the Riesel Base 3:
I'm not going to take the Riesel Base 3 above k=500,000,000. So for fairness I'm unreserving all k above 500M and keeping my reservation for all k<=500M. It has turned out to involve a great bit more work than I nescessarialy is willing to provide, and also a fact is if I'm going to complete all k's stated by the conjecture for now, the conjecture want be taken to n<=25K for all k's for at least 1530 years from now. Now some timings: Expect every 100 million k's to take up about 1 month of computation time. But to sum up, the Riesel Base 3 is now availeable for everyone for k>500M. Thanks for understanding. In case you may wonder what else I'm going to do, I will most likely spend the next 34 month working on the base 19 sierpinski. And maybe once I complete my reservation for Base 19 sierpinski I might extend it if further k's remain. Else I will propably do something else usefull Take care everyone. Kenneth! 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Bases 251500 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  2502  20230128 17:08 
Bases 33100 reservations/statuses/primes  Siemelink  Conjectures 'R Us  1751  20230121 20:37 
Bases 101250 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  1010  20230120 17:22 
Bases 632 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  1420  20221230 17:20 
Sierp base 3 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  423  20221124 15:47 