Additional
Information: 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
Prime Number Spiral Prime Number Spiral: Windows software for exploring the Prime Number (Ulam's) Spiral. Online purchase. (Software) http://www.hermetic.ch/pns/pns.htm
NewPGen NewPGen: A fast sieving program, to remove composites before they are passed to Proth, PrimeForm, PFGW, PRP, or Titanix. (Software) http://www.utm.edu/research/primes/programs/NewPGen/
PrimeForm for Windows PrimeForm for Windows: Chris Nash's primality-testing program for general mathematical expressions. Available for all 32-bit Windows operating systems and tested under Windows 95, 98, NT3.51, NT4.0, and Windows 2000. Free download. (Software) http://pages.prodigy.net/chris_nash/primeform.html
The Prime Pages' Links The Prime Pages' Links: A set of links to programs to prescreen, test, and prove primality for large primes. (Software) http://primes.utm.edu/links/programs/seeking_large_primes/
CYCLOPROV CYCLOPROV: Primality proving using cyclotomy (Alpha only) by Preda Mihailescu. (Software) http://www.inf.ethz.ch/~mihailes/CYCLOPROV/
Yves Gallot's Proth.exe Yves Gallot's Proth.exe: An implementation of Proth's Theorem for Windows that allows anyone to find very large primes. It has been used to find record primes of several forms. (Software) http://www.utm.edu/research/primes/programs/gallot/
Primo Primo: Elliptic Curve Primality Proving (ECPP) implementation. Freeware by Marcel Martin. (Software) http://www.ellipsa.net/
ECPP ECPP: The Elliptic Curve Primality Proving program by François Morain. (Software) http://www.lix.polytechnique.fr/~morain/Prgms/ecpp.english.html