Quote:
Originally Posted by Alex
Hello.
I`m working on 1000039*2^n+1 with n=[1..2.000.000] (k=1.000.039 is wellsieved).
Now it was passed n=[1..1.000.000] (8150 tests).
Code:
1000039*2^382+1 is prime! (121 decimal digits) Time : 119.587 ms.
1000039*2^466+1 is prime! (147 decimal digits) Time : 45.074 ms.
1000039*2^670+1 is prime! (208 decimal digits) Time : 48.150 ms.
1000039*2^1414+1 is prime! (432 decimal digits) Time : 41.688 ms.
1000039*2^8326+1 is prime! (2513 decimal digits) Time : 239.942 ms.
1000039*2^10810+1 is prime! (3261 decimal digits) Time : 390.164 ms.  First found in 1997 by Steffen Polster (SP code)
1000039*2^13102+1 is prime! (3951 decimal digits) Time : 642.368 ms.  First found in 1997 by Steffen Polster (SP code)
It was no new primes
Does anybody want to join me to finish the rest ~7650 tests?
The range was sieved up to p=21e12 (~40 min per factor).
PFGW / LLR is ~20 min per test.

If you have a good GPU, then you should be using srsieve2cl for sieving this sequence. If anything you might want to compare its speed to sr1sieve.