Quote:
Originally Posted by sweety439
This k is too large (>2^32), thus sr2sieve cannot handle, like that sr2sieve cannot handle the sequence (k*b^n+c)/gcd(k+c,b1) (k>=1, b>=2, c != 0, gcd(k,c) = 1, gcd(b,c) = 1) such that gcd(k+c,b1) is even (if gcd(k+c,b1) is odd, then we still can use sr2sieve to sieve the sequence k*b^n+c for the prime not dividing gcd(k+c,b1) and remove the n such that there is some prime p dividing gcd(k+c,b1) which also divides (k*b^n+c)/gcd(k+c,b1))

Sweety439, with all due respect , I didnot ask clarification of my problem ( since I also know sr2sieve doesnot working) I ask any "elegant" solution for my problem.