Top : Science : Math : Number Theory : Prime Numbers : Primality Tests : Primality Proving :
Software
Websites
A fast sieving program, to remove composites before they are passed to Proth, PrimeForm, PFGW, PRP, or Titanix.
http://www.utm.edu/research/primes/programs/NewPGen/
A set of links to programs to prescreen, test, and prove primality for large primes.
http://primes.utm.edu/links/programs/seeking_large_primes/
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.
site exerpt
PrimeForm for Windows This page is dedicated to hosting PrimeForm, a primality-testing program for general mathematical expressions based on the wonderful mathematical libraries of Yves Gallot, used with his express permission under license. The PrimeForm program is available for all 32-bit Windows operating...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.
http://www.utm.edu/research/primes/programs/gallot/
Windows software for exploring the Prime Number (Ulam's) Spiral. Online purchase.
site exerpt
Prime Number Spiral Windows software for exploring theUlamSpiral 1. Introduction An interesting prime number spiral was discovered in 1963 by Stanislaw M. Ulam, and is now called the Ulam spiral. It reveals a strange property of the prime numbers. A positive integer (1,...An Elliptic Curve Primality Proving program by François Morain. Author has later implemented fastECPP which is not publicly available.
site exerpt
P is a package containing a primality proving program. It is based in particular on the multiprecision package BigNum, developed jointly by INRIA and Digital PRL. Some primality proofs. Frequently asked questions about ECPP How do I get ECPP? Click...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.
http://primes.utm.edu/bios/page.php?id=431
Sieving program for various listed forms involving a power or primorial. Page has introduction and free downloads for Windows or Linux.
site exerpt
Paul Jobling's NewPGen This page and the program NewPGen are both written by Paul Jobling Introduction If you want to quickly find a large prime of the form k.bn+1 or k.bn-1; a large pair of twin primes, Sophie Germain primes, or a Cunningham...Program to prove large primes on the form k*2^n+/-1. Page has introduction and free Windows download.
site exerpt
Yves Gallot's Proth.exe: an implementation of Proth's Theorem for Windows Gallot wrote a program to implement the following theorem from our pages on primality proving (page three Proth's Theorem (1878 Let N k.2n+1 with 2n k. If there is an integer a such that a(N-1)/2 1 (mod N then N...