Quote:
Originally Posted by sweety439
Extended Sierpinski problem base b:
Finding and proving the smallest k>=1 such that (k*b^n+1)/gcd(k+1,b1) is not prime for all integers n>=1. (kvalues 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^n1)/gcd(k1,b1) is not prime for all integers n>=1. (kvalues 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