Faster sieving with NewPGen and srsieve

[geoff]

Originally Posted by konrad127123

This is probably a silly question, but in your code, say you have a k value such that the corresponding n values are all 2 or 18 modulo 48. The corresponding q value would then be 16. Suppose we use Q=48 as normal, your code will then sieve the 2 and 18 modulo 48 subsequences. Will it also sieve the 34 modulo 48 subsequence since 34 % 16 =2? I'm guessing the answer is no (as it should be :)), but I couldn't work it out from the quick glance at the code that I had.

No, it checks the 34 modulo 48 subsequence, discovers that it is empty, and skips to the next one. It is not a very clever way to do it, but it seems to work.