Software Primality Proving Primality Tests Prime Numbers Number Theory
Software Primality Proving Primality Tests Prime Numbers Number Theory
Software
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.
Top: Science: Math: Number Theory: Prime Numbers: Primality Tests: Primality Proving: Software
See Also:
Editor's Picks:
 - A set of links to programs to prescreen, test, and prove primality for large primes.
- A fast sieving program, to remove composites before they are passed to Proth, PrimeForm, PFGW, PRP, or Titanix.
- Windows software for exploring the Prime Number (Ulam's) Spiral. Online purchase.
- The Elliptic Curve Primality Proving program by François Morain.
- 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.
- Elliptic Curve Primality Proving (ECPP) implementation. Freeware by Marcel Martin.
- 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.
| | | | | | |
Copyright © 1995-2008 Internet Advertising Solutions, Inc.
Copyright Notice | Privacy Policy | Site Map | APR
|
 |
|
