Yves Gallot's Proth.exe
Edit Page
Report
Scan day: 17 February 2014 UTC
17
Virus safety - good
Description: Program to prove large primes on the form k*2^n+/-1. Page has introduction and free Windows download.
Yves Gallot's Proth.exe: an implementation of Proth's Theorem for Windows an implementation of Proth's Theorem for Windows Tuesday, 04-May-2010 11:10:11 CDT Originally, Yves Gallot wrote a program to implement the following theorem from our
Size: 255 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | Yves Gallot's Proth.exe: an implementation of Proth's Theorem for Windows |
| Keywords: | prime, primes, program, Proth's theorem, proving primality, primality proving, Windows 95, freeware, software, download, number theory, Cullens, twin primes, Woodall primes, Fermat divisors |
| 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. |
| IP-address: | 208.87.72.63 |
WHOIS Info
| NS | Name Servers: EXTDNS1.UTM.EDU 208.87.72.254 EXTDNS2.UTM.EDU 208.87.74.254 |
| WHOIS | |
| Date | activated: 01-Nov-1993 last updated: 12-Mar-2012 expires: 31-Jul-2014 |