| submit a site to this category |
|   |
|
|
Jean Penné's LLRURL: http://primes.utm.edu/bios/page.php?id=431 ODP description: 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. Page title: Titan Biographies: Jean Penné's LLR Page description: Welcome to the Prover Database for the List of Largest Known Primes. These pages contain a collection of records, resources and results all related to prime numbers. This pages contains the prover entry 'Jean Penné's LLR.' ![]() |
|
|
Yahoo Groups: PrimeformURL: http://groups.yahoo.com/group/primeform/ ODP description: 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. Page title: primeform : User group for PFGW & PrimeForm programs Page description: primeform: User group for PFGW & PrimeForm programs ![]() |
|
|
PrimoURL: http://www.ellipsa.net/ ODP description: Elliptic Curve Primality Proving program which has set monoprocessor ECPP records. Windows freeware by Marcel Martin. Page title: Ellipsa Homepage Page description: Ellipsa Homepage ![]() |
|
|
Paul Jobling's NewPGenURL: http://primes.utm.edu/programs/NewPGen/ ODP description: Sieving program for various listed forms involving a power or primorial. Page has introduction and free downloads for Windows or Linux. Page description: Another page about Prime Numbers and related topics. ![]() |
|
|
Glucas - Yet Another FFTURL: http://www.oxixares.com/glucas/ ODP description: Free software program to test primality of Mersenne numbers (numbers with the form 2^n - 1). ![]() |
|
|
ECPPURL: http://www.lix.polytechnique.fr/~morain/Prgms/ecpp.english.html ODP description: An Elliptic Curve Primality Proving program by François Morain. Author has later implemented fastECPP which is not publicly available. ![]() |
|
|
Prime Number SpiralURL: http://www.hermetic.ch/pns/pns.htm ODP description: Windows software for exploring the Prime Number (Ulam's) Spiral. Online purchase. Page description: The Prime Number Spiral (a.k.a. the Ulam Spiral) is formed by marking the prime numbers in a spiral arrangement of the natural numbers. This is software is for exploring the Prime Number Spiral. ![]() |
|
|
Yves Gallot's Proth.exeURL: http://primes.utm.edu/programs/gallot/ ODP description: Program to prove large primes on the form k*2^n+/-1. Page has introduction and free Windows download. Page title: Yves Gallot's Proth.exe: an implementation of Proth's Theorem for Windows Page description: Proth.exe is a Windows program by Yves Gallot which efficiently implements Proths's theorem and allows anyone to find very large primes. It has been used to find record primes of several forms including Fermat factors, twin primes, Cullen primes and Woodall primes. ![]() |
|
|
The Prime Pages' LinksURL: http://primes.utm.edu/links/programs/seeking_large_primes/ ODP description: A set of links to programs to prescreen, test, and prove primality for large primes. Page title: The Prime Page's Links++: programs/seeking_large_primes Page description: Programs to prescreen, test, and prove primality for large primes. ![]() |
|
| |