| 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 "Sieving program"
(restored) |
m |
||
| Line 6: | Line 6: | ||
*[[Srsieve]] (performing sieving of k × b<sup>n</sup>+-c with fixed b,multiple fixed k,c and variable n) http://sites.google.com/site/geoffreywalterreynolds/programs/srsieve | *[[Srsieve]] (performing sieving of k × b<sup>n</sup>+-c with fixed b,multiple fixed k,c and variable n) http://sites.google.com/site/geoffreywalterreynolds/programs/srsieve | ||
*[[Gcwsieve]] (performing sieving of generalized Cullen/Woodall numbers n × b<sup>n</sup>+-1) http://sites.google.com/site/geoffreywalterreynolds/programs/gcwsieve | *[[Gcwsieve]] (performing sieving of generalized Cullen/Woodall numbers n × b<sup>n</sup>+-1) http://sites.google.com/site/geoffreywalterreynolds/programs/gcwsieve | ||
| − | *[[PPSieve]] (sieving for factors of numbers of the form K × 2<sup>n</sup> + 1 or - 1. Independent of K's, but good for many N's too) and [[TPSieve]] (similar to PPSieve, but for finding [[twin | + | *[[PPSieve]] (sieving for factors of numbers of the form K × 2<sup>n</sup> + 1 or - 1. Independent of K's, but good for many N's too) and [[TPSieve]] (similar to PPSieve, but for finding [[twin prime]]s of the same form) http://sites.google.com/site/kenscode/prime-programs |
*[[AthGFNSieve]] (performing sieving of generalized Fermat numbers b<sup>2<sup>n</sup></sup>+1) http://www.underbakke.com/AthGFNsv/ | *[[AthGFNSieve]] (performing sieving of generalized Fermat numbers b<sup>2<sup>n</sup></sup>+1) http://www.underbakke.com/AthGFNsv/ | ||
*[[FermFact]] (performing sieving of Proth numbers) http://www.fermatsearch.org/FermFact-09b.zip | *[[FermFact]] (performing sieving of Proth numbers) http://www.fermatsearch.org/FermFact-09b.zip | ||
Revision as of 11:25, 19 February 2019
A Sieving program is a program that performs sieving.
List
- NewPGen (performing sieving of different kinds of number) http://primes.utm.edu/programs/NewPGen/
- MultiSieve (performing sieving of different kinds of number) http://home.roadrunner.com/~mrodenkirch/home/MultiSieve.html
- Srsieve (performing sieving of k × bn+-c with fixed b,multiple fixed k,c and variable n) http://sites.google.com/site/geoffreywalterreynolds/programs/srsieve
- Gcwsieve (performing sieving of generalized Cullen/Woodall numbers n × bn+-1) http://sites.google.com/site/geoffreywalterreynolds/programs/gcwsieve
- PPSieve (sieving for factors of numbers of the form K × 2n + 1 or - 1. Independent of K's, but good for many N's too) and TPSieve (similar to PPSieve, but for finding twin primes of the same form) http://sites.google.com/site/kenscode/prime-programs
- AthGFNSieve (performing sieving of generalized Fermat numbers b2n+1) http://www.underbakke.com/AthGFNsv/
- FermFact (performing sieving of Proth numbers) http://www.fermatsearch.org/FermFact-09b.zip
- Fermat (performing sieving of factors of Fermat numbers, for Windows) http://www.fermatsearch.org/Fermat_44_beta.zip
- GMP-Fermat (performing sieving of factors of Fermat numbers, for Linux and Windows) http://www.fermatsearch.org/download.html
- TwinGen (performing sieving of numbers of the form k×2n+/-1) http://www.underbakke.com/primes/
External links
- Mersenneforum section on factoring programs links contains several links to sieving programs.
- Geoff Reynold's sieving suite
