Quote:
Originally Posted by YaoPlaysMC
I'm using k*2^n-1
|
That's the Riesel prime form, and you should use srsieve2 (from the mtsieve package) to start the sieve, and then either sr1sieve (if you're working with one or two
k's) or sr2sieve (if you're sieving more than two
k's) to finish it. The advice Dylan gave on when to stop is correct, and I'll add that you should be using LLR for numbers of this form.
Edit: I read the replies first and then the OP.
Disregard what I said except that you should use LLR instead of PFGW.