Quote:
Originally Posted by sweety439
The divisor of k*b^n+1 (+ for Sierp,  for Riesel) is always gcd(k+1,b1) (+ for Sierp,  for Riesel) (see post https://mersenneforum.org/showpost.p...&postcount=230), since gcd(k+1,b1) is the trivial factor of k*b^n+1, it is simply to take out this factor, thus, the divisor of R43, k=13 is 6, not 2 (gcd(131,431) = 6), and the formula of R43, k=13 is (13*43^n1)/6, not (13*43^n1)/2

Of course you are correct. I was only giving a simplified example. Even though the divisor here is 6 we still have the same problem with srsieve or srsieve2 giving an immediate error when all candidates are divisible by 2.
We simply need this error check removed from srsieve and/or srsieve2.