20160308, 06:54  #1 
"NOT A TROLL"
Mar 2016
California
197 Posts 
Fastest sieving program?
I am looking for the fasted sieving program I can use to find (probable) primes of the form k*b^n+c. Also, which value: k, b, n, or c would be the easiest to (substitute) find primes for? For a sample test, try the form 31*52^n+21, or just fix the variables for this form and choose a high n value.

20160308, 11:56  #3 
"NOT A TROLL"
Mar 2016
California
11000101_{2} Posts 
I looked on a version of Proth's Theorem and says the base b must be prime for k*b^n+1. Is this true?

20160308, 11:56  #4 
Romulan Interpreter
"name field"
Jun 2011
Thailand
9787_{10} Posts 
srsieve

20160308, 12:02  #5 
Sep 2002
Database er0rr
2·3^{2}·5·43 Posts 

20160308, 12:04  #6 
"NOT A TROLL"
Mar 2016
California
197 Posts 

20160308, 12:10  #8  
Sep 2002
Database er0rr
2·3^{2}·5·43 Posts 
Quote:


20160308, 12:14  #10 
Sep 2002
Database er0rr
111100011110_{2} Posts 
No. The current record for Primo is 30k digits. To make the top5000 you need ~400k digits. Only c=+1 will get you into the top5000, because the proof is rapid.
Last fiddled with by paulunderwood on 20160308 at 12:16 
20160308, 12:19  #11  
"NOT A TROLL"
Mar 2016
California
197 Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
The Fastest Path  a1call  Puzzles  23  20160323 17:46 
Fastest you've driven a car?  Oddball  Lounge  43  20110314 00:26 
Fastest Primality Tests  flouran  Miscellaneous Math  174  20100715 00:02 
Looking for a sieving program  jasong  Math  17  20070321 18:50 
The fastest way to a top5000 prime?  lsoule  15k Search  13  20050919 20:24 