View Single Post
Old 2005-12-29, 08:40   #3
jasong
 
jasong's Avatar
 
"Jason Goatcher"
Mar 2005

3·7·167 Posts
Default

Quote:
Originally Posted by axn1
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.
I doublechecked the irc logs, unless the person is dyslexic, it's n*2^k-1.

Also, because of the nature of the problem I decided to undertake, I can't simply increment the k-value by an amount, unless I'm satisfied with 2 ks at a time.

I appreciate your attempt to help me, though.
jasong is offline   Reply With Quote