View Single Post
Old 2020-08-08, 06:30   #933
sweety439
 
sweety439's Avatar
 
Nov 2016

45028 Posts
Default

Quote:
Originally Posted by sweety439 View Post
Extended Sierpinski problem base b:

Finding and proving the smallest k>=1 such that (k*b^n+1)/gcd(k+1,b-1) is not prime for all integers n>=1. (k-values that make a full covering set with all or partial algebraic factors are excluded from the conjectures)

Extended Riesel problem base b:

Finding and proving the smallest k>=1 such that (k*b^n-1)/gcd(k-1,b-1) is not prime for all integers n>=1. (k-values that make a full covering set with all or partial algebraic factors are excluded from the conjectures)
This b must be >=2, and the b=2 case is the original Sierpinski/Riesel problems, this project extend these Sierpinski/Riesel problems to bases b>2
sweety439 is offline   Reply With Quote