About: Largest known prime   Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

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:

AttributesValues
rdfs:label
  • Largest known prime
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/p...iPageUsesTemplate
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:
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software