20080115, 04:18  #155 
Sep 2004
UVic
2·5·7 Posts 
14910 prime found
14910*2^151864+1 is prime! Time: 33.493 sec.
aka 14910*16^37966+1 results file attached. continuing existing reservation 
20080115, 07:44  #156 
Jan 2005
111011111_{2} Posts 
69998*31^136181 is prime!
(with no other primes upto 20k) That eliminates all MOB's for base 31 riesel. 
20080115, 20:29  #157 
Jan 2006
Hungary
10C_{16} Posts 
Need some more ranges
Hidiho,
some of my ranges will finish this week, I'll take some more: Riesel, for n where it is now to 100000 594*27^n1 233*28^n1 1422*28^n1 2319*28^n1 4001*28^n1 Willem. 
20080116, 08:23  #158  
May 2007
Kansas; USA
2×5×17×61 Posts 
Quote:
G 

20080116, 11:23  #159 
"Jason Goatcher"
Mar 2005
3×7×167 Posts 
If no one objects, I'd like to reserve 16734*4^n1. That's base=4, k=16734, Riesel numbers(1). I believe the nvalues that need to be tested start at n=100K.
If there's a sieved file, I'd love to know about it. Also, if people would rather I sieve than LLR, I can do that to. I just ask that the digit length of the lowest untested value in the sieve file be no more than twice the digit length of any unLLred value in a lower base. In that instance, I'd probably want to sieve a lower base. Last fiddled with by jasong on 20080116 at 11:24 
20080116, 11:47  #160  
"Jason Goatcher"
Mar 2005
3·7·167 Posts 
Quote:
5 and 17 are Fermat primes, anything going on with base 17? 

20080116, 18:10  #161  
May 2007
Kansas; USA
10100010000010_{2} Posts 
Quote:
Jasong, I'm not sure I quite follow you here about 2X length of LLR'd value of lower base. I can only speculate that you might like to save sieving/LLRing time if Riesel k=16734/2=8367 base 2 has known testing above n=200K (n=100K base 4) to avoid doubletesting. When setting up the pages, I checked all k's on bases that are powers of 2 for primes in the prime archives at the top5000 site and at www.rieselprime.org (converted from base 2) before putting anything up for testing. As shown on the latter site, k=8367 has only been tested to n=10K base 2 (n=5K base 4) and has no primes that are oddn so you're OK there. I think this is a very good idea to reserve this base 4 vs. base 16. It is open for both bases. It would be a waste of time for someone to sieve/test k=16734 base 16 and then turn around and do it for base 4. Perhaps that's part of what you're referring to. In this case, I'll show you as reserving k=16734 on both base 4 and base 16. Otherwise someone could duplicate you base 16. One caviot...If you find an evenn prime base 4 (n==0mod4 base 2), that will also eliminate the k on base 16 and you could stop testing. But if you find an oddn prime base 4 (n==2mod4 base 2), I would suggest deleting all oddn's in your sieve file and continue from there looking for an evenn base 16 prime. Of course it's your choice to continue on for base 16 but it's a way to kill two birds with one stone. You could even end up with two different top5000 primes; one for each base! Gary Last fiddled with by gd_barnes on 20080116 at 18:13 

20080116, 19:15  #162  
May 2007
Kansas; USA
2×5×17×61 Posts 
Quote:
Robert demonstrated some time ago that bases where b=2^q1 are the most problematic. I haven't looked beyond base 31 in that regard. Certainly, bases 3, 7, and 15 are the big problem children and base 31 to a lesser extent. (Bases 19 and 25 will most likely prove to be problematic also.) Michaf has done a nice job on Riesel base 31 with a relatively high conjecture of k=134718 getting it down 14 k's remaining at n=28.9K. But the Sierp side will be a pain with a conjecture of k=6360528. Sierp base 24 seems to be the most difficult to find primes on for some reason. With a relatively low conjecture of k=30651, it still has 173 k's remaining (> 0.5%) at n=15K. This is by far the highest percentage that I can remember of remaining k's at that level of testing. I haven't analyzed it in depth to determine why this is happening. Gary 

20080116, 21:03  #163 
Jan 2005
111011111_{2} Posts 
Happy to get riesel31 to a mere 13 primes remaining:
48212*31^306911 is prime That leaves 13 k’s to test I've now tested upto 31k 
20080116, 21:18  #164 
Jan 2005
479 Posts 
and some more fun with sierpinski 24:
21276*24^15196+1 is prime 11874*24^15419+1 is prime 28591*24^15910+1 is prime That leaves 169 k’s to test I’ve done upto 16.6k now, so many more to come... 
20080116, 21:24  #165  
May 2007
Kansas; USA
2×5×17×61 Posts 
Quote:
Quote:
Micha, Did you add back MOB k=17496 to Sierp base 24? I had tested it to n=6.5K with no prime and had added one to your remaining k's from before. I had assumed that you had previously removed it per the prior project description. So this would now make 170 k's remaining unless you found a prime for it. Gary 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Bases 251500 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  2282  20210515 15:40 
Bases 101250 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  901  20210515 15:40 
Bases 5011030 reservations/statuses/primes  KEP  Conjectures 'R Us  3858  20210514 18:22 
Bases 33100 reservations/statuses/primes  Siemelink  Conjectures 'R Us  1683  20210514 15:04 
Riesel base 3 reservations/statuses/primes  KEP  Conjectures 'R Us  1098  20210418 21:07 