Top: Science: Math: Number_Theory: Prime_Numbers: Primality_Tests: Primality_Proving: Software:
Attention webmaster:

fopen(cache/d4cf3f4291947884fe37c9bd85ca37d8) [function.fopen]: failed to open stream: No such file or directory
Attention webmaster:

Error writing to cache!
Make sure the cache folder exists and is writeable by this script (you may also disable the cache)

See also:


  • The Prime Pages' Links   - A set of links to programs to prescreen, test, and prove primality for large primes.

  • ECPP - An Elliptic Curve Primality Proving program by François Morain. Author has later implemented fastECPP which is not publicly available.
  • Glucas - Yet Another FFT - Free software program to test primality of Mersenne numbers (numbers with the form 2^n - 1).
  • 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.
  • Prime Number Spiral - Windows software for exploring the Prime Number (Ulam's) Spiral. Online purchase.
  • 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.