20201116, 17:59  #1 
Nov 2020
1010_{2} Posts 
When should I stop using NewPGen and start primality testing?
I'm using NewPGen.
The n value is 4,001,337 and the range of k I'm using is 1,000,000 to 21,000,000. When should I stop sieving? 
20201116, 19:48  #2 
"Mark"
Apr 2003
Between here and the
7·29·31 Posts 

20201116, 20:50  #3 
Nov 2020
12_{8} Posts 
I'm using k*2^n1

20201116, 22:35  #4 
"Dylan"
Mar 2017
2·7·41 Posts 
If you are sieving k*2^n1 you should consider using mtsieve, which has a sieve called fbncsieve which can sieve this form faster than newpgen (and it's multithreaded too).
Anyway, to answer your question, you'll want to stop sieving when the time it takes to test a candidate with pfgw or LLR is equal to the time it takes to remove a term from the sieve file. 
20201117, 07:51  #5 
"Alexander"
Nov 2008
The Alamo City
2^{2}·5·29 Posts 
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. Last fiddled with by Happy5214 on 20201117 at 07:58 Reason: Goofed. 
20201117, 08:05  #6  
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
10010010110110_{2} Posts 
Quote:
▪ Plan A. You want to sieve and then you want to test all of them and find all primes (~4 or even 78 if you keep even k values in the sieve), then see answer above. ▪ Plan B. You want to find one prime and then stop. Then you should stop earlier (~48 times earlier); you should have sieved in a range which is 234 times smaller, too. Use well known estimates for density of primes and a couple pencil lines on a napkin. ▪ Plan C. Take previously sieved RPS files (they are deeper than you can ever dream to sieve), and take n>=4,001,337. Then when you do find a prime, you can always reformat it in a way that n is exactly 4,001,337 and k will be even, but so what. Your n is arbitrary anyway. In either case, the earlier you run pencil estimates of how many core years you will need to spend , the better, maybe even before starting sieving. Do you have access to the required number of coreyears? 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Running prime95 over night then automatically stop/start  patgie  Information & Answers  13  20180128 19:08 
How do I start testing after setting to run only on mains power  primecrusader  Information & Answers  2  20160909 04:45 
a new Deterministic primality testing  wsc812  Computer Science & Computational Number Theory  36  20130304 06:25 
a new primality testing method  jasong  Math  1  20071106 21:46 
Start and Stop Prime 95 on Large Groups of Windows XP Machines  MarcGetty  Software  3  20060307 07:54 