20201223, 21:46  #1179 
Nov 2016
2^{2}×691 Posts 
We can use the sense of http://www.iakovlev.org/zip/riesel2.pdf to conclude that (k*b^n+c)/gcd(k+c,b1) (k>=1, b>=2, c != 0, gcd(k,c) = 1, gcd(b,c) = 1) eventually should yield a prime, when it does not have primes for small n>=1
We should find the n's such that (k*b^n+c)/gcd(k+c,b1) does not have small prime factors (and the znorder of b mod its prime factors are also not small), nor has algebra factors (i.e. k*b^n and c are both rth powers for some r>1, or k*b^n*c is of the form 4*m^4) Last fiddled with by sweety439 on 20201223 at 21:52 
20201227, 19:47  #1180 
Nov 2016
2^{2}·691 Posts 
Update pdf files for the Sierpinski/Riesel conjectures

20201228, 02:00  #1181 
Nov 2016
2764_{10} Posts 
Update newest status text file for R/S 40

20201229, 12:11  #1182 
Nov 2016
2^{2}·691 Posts 
Riesel base 2021 is proven!!! With CK=13, see https://github.com/xayahrainie4793/E...0to%202048.txt
Code:
k,n 1,67 2,1048 3,1773 4,3 5,140 6,2 7,117 8,2 9,1 10,269 11,14 12,1 
20201229, 14:44  #1183 
Mar 2006
Germany
2×1,433 Posts 
So you got your own definition of GCD?
In the first post reads (for Riesel side): (k*b^n1)/gcd(k1, b1) b=2021, k=1, n=67 (from table above) GCD for k=1 in the above formula is undefined and so (1*2021^671)/2020 is prime but do not correlates to your definiton of the problem and the definition of GCD. 
20201230, 01:27  #1184  
Nov 2016
2^{2}×691 Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
The dual Sierpinski/Riesel problem  sweety439  sweety439  13  20201223 23:56 
Semiprime and nalmost prime candidate for the k's with algebra for the Sierpinski/Riesel problem  sweety439  sweety439  11  20200923 01:42 
The reverse Sierpinski/Riesel problem  sweety439  sweety439  20  20200703 17:22 
Sierpinski/ Riesel bases 6 to 18  robert44444uk  Conjectures 'R Us  139  20071217 05:17 
Sierpinski/Riesel Base 10  rogue  Conjectures 'R Us  11  20071217 05:08 