| Property | Value |
|---|
| rdfs:label | |
| rdfs:comment | - The most efficient known algorithm for finding large prime numbers is the Lucas-Lehmer test, which tests Mersenne primes. Thus the largest known primes have been Mersenne primes for a long time. George Woltman's distributed computing program GIMPS, an implementation of the Lucas-Lehmer test, has found all the new records since 1996. A list of record primes (as of January 19, 2016) is given below:
|
| dcterms:subject | |
| dbkwik:googology/property/wikiPageUsesTemplate | |
| abstract | - The most efficient known algorithm for finding large prime numbers is the Lucas-Lehmer test, which tests Mersenne primes. Thus the largest known primes have been Mersenne primes for a long time. George Woltman's distributed computing program GIMPS, an implementation of the Lucas-Lehmer test, has found all the new records since 1996. A list of record primes (as of January 19, 2016) is given below:
|
