Ars Technica Team Prime Rib
Edit Page
Report
Scan day: 17 February 2014 UTC
24
Virus safety - good
Description: A distributed computing team dedicated to finding Mersenne prime numbers.
In mathematics and more precisely in modular arithmetic, a Mersenne prime is a prime number being written in the form 2^p - 1, p being first. These primes are named after French mathematician and a scholar of the seventeenth century, Marin Mersenne. Mersenne primes are in base 2 (binary). Mersenne primes are related to perfect numbers, which are numbers equal to the sum of their proper divisors. It is this connection that has historically driven the study of Mersenne primes. From the fourth century BC, Euclid proved that if M = 2^p - 1 is prime, then M (M +1) / 2 = 2 (p-1) (2p - 1) is a perfect number. Two millennia later, in the eighteenth century, Euler proved that all even perfect numbers have this form. No odd perfect numbers are known.
Size: 750 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | Team Prime Rib Game |
| Keywords: | FFT, GIMPS, Glucas, Lucas-Lehmer, Mersenne, Mlucas, Prime, Prime95, PrimeNet |
| Description: | Gimps Team Prime Rib Stats |
| IP-address: | 184.82.156.50 |
WHOIS Info
| NS | Name Server: NS67.LACEHOST.COM Name Server: NS68.LACEHOST.COM |
| WHOIS | Status: clientTransferProhibited |
| Date | Creation Date: 10-aug-2001 Expiration Date: 10-aug-2014 |