| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "NewPGen"
(restored) |
m |
||
| Line 9: | Line 9: | ||
*k×b<sup>n</sup>±1, 2k×b<sup>n</sup>+1 (mixed twin and Cunningham chain) | *k×b<sup>n</sup>±1, 2k×b<sup>n</sup>+1 (mixed twin and Cunningham chain) | ||
*k×b<sup>n</sup>±1, 2k×b<sup>n</sup>-1 (mixed twin and Sophie Germain) | *k×b<sup>n</sup>±1, 2k×b<sup>n</sup>-1 (mixed twin and Sophie Germain) | ||
| − | *k×b<sup>n</sup>±1, | + | *k×b<sup>n</sup>±1, k×b<sup>n</sup>+1, ½k×b<sup>n</sup>+1 (to test k×b<sup>n</sup>+1, and if that is prime check the other 3 for the chance of a twin prime or CC 2nd kind) |
| − | *k×b<sup>n</sup>±1, 2k×b<sup>n</sup>-1, | + | *k×b<sup>n</sup>±1, 2k×b<sup>n</sup>-1, ½k×b<sup>n</sup>-1 (to test k×b<sup>n</sup>-1, and if that is prime check the other 3 for the chance of a twin prime or Sophie Germain) |
*Cunningham chains of the first or second kinds of arbitrary length | *Cunningham chains of the first or second kinds of arbitrary length | ||
*BiTwin chains of arbitrary length | *BiTwin chains of arbitrary length | ||
| Line 30: | Line 30: | ||
When searching for these kinds of primes you ought to rapidly sieve out any k or n divisible by small primes. Since it works with a large set of numbers and uses fast implementations, it is a lot better than performing [[trial factoring]] on each number in the set. | When searching for these kinds of primes you ought to rapidly sieve out any k or n divisible by small primes. Since it works with a large set of numbers and uses fast implementations, it is a lot better than performing [[trial factoring]] on each number in the set. | ||
| − | Its output can be used with any other program for [[primality test]]ing the numbers. Some examples are [[PRP]], [[ | + | Its output can be used with any other program for [[primality test]]ing the numbers. Some examples are [[PRP]], [[LLR]] and [[PFGW]]. |
| − | It's currently available on its official site on the http://primes.utm.edu/programs/NewPGen/ Prime | + | It's currently available on its official site on the [http://primes.utm.edu/programs/NewPGen/ The Prime Pages]. |
[[Category:Sieving program]] | [[Category:Sieving program]] | ||
Revision as of 14:03, 7 February 2019
NewPGen is a program written by Paul Jobling that is used to sieve a set of many candidate numbers, of the following forms:
- k×bn+1
- k×bn-1
- k×bn±1 (twin primes)
- k×bn-1, 2k×bn-1 (Sophie Germain)
- k×2n+1, k×2n+1+3 (Sophie Germain)
- k×bn+1, 2k×bn+1 (Cunningham Chain 2nd kind, length 2)
- k×bn±1, 2k×bn±1 (BiTwin chain length 1)
- k×bn±1, 2k×bn+1 (mixed twin and Cunningham chain)
- k×bn±1, 2k×bn-1 (mixed twin and Sophie Germain)
- k×bn±1, k×bn+1, ½k×bn+1 (to test k×bn+1, and if that is prime check the other 3 for the chance of a twin prime or CC 2nd kind)
- k×bn±1, 2k×bn-1, ½k×bn-1 (to test k×bn-1, and if that is prime check the other 3 for the chance of a twin prime or Sophie Germain)
- Cunningham chains of the first or second kinds of arbitrary length
- BiTwin chains of arbitrary length
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:
- k×n#+1
- k×n#-1
- k×n#±1 (twin primes)
- k×n#-1, 2×k×n#-1 (Sophie Germain)
- k×n#+1, 2×k×n#+1 (Cunningham Chain 2nd kind, length 2)
- k×n#±1, 2×k×n#±1 (BiTwin chain length 1)
- k×n#±1, 2×k×n#+1 (mixed twin and Cunningham chain)
- k×n#±1, 2×k×n#-1 (mixed twin and Sophie Germain)
- k×n#±1, ½×k×n#+1,2×k×n#+1 (to test k×n#+1, and if that is prime check the other 3 for the chance of a twin prime or CC 2nd kind)
- k×n#±1, ½×k×n#-1,2×k×n#-1 (to test k×n#+1, and if that is prime check the other 3 for the chance of a twin prime or Sophie Germain)
- Cunningham chains of the first or second kinds of arbitrary length
- BiTwin chains of arbitrary length
When searching for these kinds of primes you ought to rapidly sieve out any k or n divisible by small primes. Since it works with a large set of numbers and uses fast implementations, it is a lot better than performing trial factoring on each number in the set.
Its output can be used with any other program for primality testing the numbers. Some examples are PRP, LLR and PFGW.
It's currently available on its official site on the The Prime Pages.
