View Single Post
Old 2005-12-29, 08:30   #2
axn's Avatar
Jun 2003

2×33×7×13 Posts

I think the form you are looking for is 2^n-k. You can do a Google search for "Dual Sierpinski problem" to find more details.

NewPGen supports the sieving of b^n+/-k with fixed k.

As for sieving multiple k's one after the other, I think you should be able to use the "Sieve Until..." Option. Here you can set stop criteria for how far to sieve a single k, and the increment the k and move on.

You might also want to look at PFGW for such things, since you'll also be able to test the candidates for primality.
axn is offline   Reply With Quote