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.
Related categories 3
Sites 6
ECPP
An Elliptic Curve Primality Proving program by François Morain. Author has later implemented fastECPP which is not publicly available.
Jean Penné's LLR
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
Sieving program for various listed forms involving a power or primorial. Page has introduction and free downloads for Windows or Linux.
Primo
Elliptic Curve Primality Proving program which has set monoprocessor ECPP records. Windows freeware by Marcel Martin.
Yahoo Groups: 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
Program to prove large primes on the form k*2^n+/-1. Page has introduction and free Windows download.
![[Telescope Mozilla]](../../../../../../../img/moz/telescope1.gif)
Last update:
April 30, 2016 at 17:57:34 UTC