20200731, 05:26  #122  
Nov 2016
23×97 Posts 
Quote:
S8: 256 (GFN, at n=(2^338)/31), 370 (extended, corresponding number should be divided by 7 to get a prime since 370*8^n+1 has trivial factor of 7, at n=10K), 467 (at n=833333 due to http://www.prothsearch.com/riesel1a.html) R8: 239 (extended, corresponding number should be divided by 7 to get a prime since 239*8^n1 has trivial factor of 7, at n=10K), 247 (at n=76666 due to http://www.prothsearch.com/riesel2.html), 757 (extended, corresponding number should be divided by 7 to get a prime since 757*8^n1 has trivial factor of 7, at n=10K) R9: 386, 744 (both at n=25K) S12: 12 (GFN, at n=2^252), 885, 911, 976, 1041 (all k except k=12 at n=25K) R12: 1132 (at n=21760) 

20200806, 08:28  #123 
Nov 2016
23×97 Posts 
These are the status for the first 4 conjectures for SR32 and SR128 (I only update the powerof2 bases here, since they are more interesting, for more SR bases, see the files in post https://mersenneforum.org/showpost.p...&postcount=930 and the GitHub page https://github.com/xayahrainie4793/f...elconjectures)
Code:
base CK remain k S32 10, 23, 43, 56 4, 16 (proven if GFN are excluded) R32 10, 23, 43, 56 29 (at n=2M by CRUS search for R1024) S128 44, 85, 98, 173 16, 40, 47, 83, 88, 94, 122 R128 44, 59, 85, 86 46 Last fiddled with by sweety439 on 20200806 at 08:32 
20200806, 16:09  #124  
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
2·2,861 Posts 
Quote:


20200807, 15:47  #125  
Nov 2016
23×97 Posts 
Quote:
e.g. S4 for all k: 10K S7 for all k: 3K R7 for k == 1 mod 6: 3K R7 for other k: 15K (given using page https://www.rosehulman.edu/~rickert/Compositeseq/) S10 for k = 100: 2^313 S10 for k = 269: 100K S12 for k = 12: 2^252 S12 for other k: 25K R12 (only one k remain: 1132): 21760 S25 for k = 71 and k = 181: 10K S25 for k = 222: 350K (given by CRUS) SR26 for all k: 2K Last fiddled with by sweety439 on 20200807 at 15:47 

20200807, 15:52  #126 
Nov 2016
23×97 Posts 
There are pages shown the status (including the test limit) for the conjectures of (k*b^n+1)/gcd(k+1,b1) (+ for Sierpinski,  for Riesel) with bases 2<=b<=128 and b=256, 512, 1024
Sierpinski conjectures Riesel conjectures Edit: the test limit for S10 k=100 is now 2^313 (2.147G), see http://www.prothsearch.com/GFN10.html Last fiddled with by sweety439 on 20200807 at 15:54 
20200808, 15:52  #127  
Nov 2016
23·97 Posts 
Quote:
Update the correct file for S8 k<=1024 Last fiddled with by sweety439 on 20200808 at 15:56 

20200818, 17:24  #128 
Nov 2016
2231_{10} Posts 
https://github.com/xayahrainie4793/allk1024
All k<=1024 for all bases 2<=b<=32 and b=64, 256, searched up to n=4096 Last fiddled with by sweety439 on 20200818 at 17:34 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Bases 5011030 reservations/statuses/primes  KEP  Conjectures 'R Us  3718  20200909 15:54 
Numbers in Other Bases  Stargate38  Lounge  23  20200811 22:38 
k*b^n+/1, Bases 271 and 11971  robert44444uk  Math  21  20131107 15:01 
Other Bases?  wblipp  GPU Computing  50  20121011 13:23 
Starting new bases  MrOzzy  Conjectures 'R Us  104  20100318 22:11 