|[ Introduction | Usage | Technical Specifications | Download ]||Current version:
Last modified: Tuesday, 17-Dec-2007
|(This page and the program NewPGen are both written by Paul Jobling).|
If you want to quickly find a large prime of the form k.bn+1 or k.bn-1; a large pair of twin primes, Sophie Germain primes, or a Cunningham Chain of length two; a large BiTwin chain; or a large and long Cunningham Chain, then the last thing that you should use is Yves Gallot's Proth.exe! I say the last thing because before that you ought to quickly sieve out any k, n values that are divisible by small primes. If n is fixed then this can be done very efficiently, reducing the overall search time. Another advantage of fixing n is that you can have a good idea of the overall probability of a successful search.
This program, NewPGen, performs this type of sieving. NewPGen
should be used to throw out candidate k's until the rate at which
it is removing them exceeds the rate at which Proth.exe can perform a
power test. At that point Proth.exe should be used to complete the search, with
(as trial factoring has already been performed by NewPGen).
See the Prime Links++ page on seeking large primes for related programs (like Proth.exe and PRP).
To use NewPGen, simply start it up. You can obtain help from the Help menu item, though it ought to be fairly self-explanatory. Simple enter the name of the file to generate, the values of the base and n to use, the range of k to use, the type of sieve to perform, and press the Start button.
The number of k's that can be sieved is dependent upon available memory. The more k's that you sieve, the greater the overall time saved, as more k's are available to be thrown out.
NewPGen can currently sieve for the following types of search:
NewPGen can also be used to generate an output file to use with some Primeform searches. These are basically the same as the above, save that a primorial is used: