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.
More information
More information
Related categories 3
Sites 5
An Elliptic Curve Primality Proving program by François Morain. Author has later implemented fastECPP which is not publicly available.
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.
Sieving program for various listed forms involving a power or primorial. Page has introduction and free downloads for Windows or Linux.
Elliptic Curve Primality Proving program which has set monoprocessor ECPP records. Windows freeware by Marcel Martin.
Program to prove large primes on the form k*2^n+/-1. Page has introduction and free Windows download.
Elliptic Curve Primality Proving program which has set monoprocessor ECPP records. Windows freeware by Marcel Martin.
An Elliptic Curve Primality Proving program by François Morain. Author has later implemented fastECPP which is not publicly available.
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.
Sieving program for various listed forms involving a power or primorial. Page has introduction and free downloads for Windows or Linux.
Program to prove large primes on the form k*2^n+/-1. Page has introduction and free Windows download.
