Directory of Software Resources
Home > Science > Math > Number Theory > Prime Numbers > Primality Tests > Primality Proving > Software
The various algorithms to determine the primality or compositeness of a number are ideally suited to computer programs, particularly when the numbers are large. This category lists programs designed specifically to search for prime numbers and prove their primality.
Resources in This Category
-
ECPP
http://www.lix.polytechnique.fr/~morain/Prgms/ecpp.english.html
An Elliptic Curve Primality Proving program by François Morain. Author has later implemented fastECPP which is not publicly available. -
Jean Penné's LLR
http://primes.utm.edu/bios/page.php?id=431
Proves k*2^n-1 with the Lucas-Lehmer-Riesel algorithm and k*2^n+1 with Proth's theorem. Free Windows and Linux download. -
Paul Jobling's NewPGen
http://primes.utm.edu/programs/NewPGen/
Sieving program for various listed forms involving a power or primorial. Page has introduction and free downloads for Windows or Linux. -
Primo
http://www.ellipsa.eu/
Elliptic Curve Primality Proving program which has set monoprocessor ECPP records. Windows freeware by Marcel Martin. -
Yahoo Groups: Primeform
http://groups.yahoo.com/group/primeform/
Discussion group for PrimeFormGW and prime numbers. Program can trial factor and probable prime test any number, and prove many forms. Free Windows and Linux downloads after joining group. -
Yves Gallot's Proth.exe
http://primes.utm.edu/programs/gallot/
Program to prove large primes on the form k*2^n+/-1. Page has introduction and free Windows download.
Related Categories
- Home > Computers > Computer Science > Distributed Computing > Projects > Cryptography
- Home > Science > Math > Number Theory > Prime Numbers > Mersenne
- Home > Science > Math > Number Theory > Software
Home > Science > Math > Number Theory > Prime Numbers > Primality Tests > Primality Proving > Software
Thanks to DMOZ, which built a great web directory for nearly two decades and freely shared it with the web. About us
