At this site we maintain a list of the 5000 Largest Known Primes which is updated hourly. This list is the most important databases at The Prime Pages: a collection of research, records and results all about prime numbers. This page summarizes our information about one of these primes.
This prime's information:
|Description:||"'css_descramble.c.gz' · 21688 + 99"|
|Verification status (*):||PRP|
|Official Comment:||Illegal prime, ECPP|
|Proof-code(s): (*):||c5 : Carmody, Primo|
|Decimal Digits:||1905 (log10 is 1904.00847685)|
|Rank (*):||88952 (digit rank is 6)|
|Entrance Rank (*):||31241|
|Currently on list? (*):||no|
|Submitted:||3/14/2001 00:17:41 CDT|
|Last modified:||3/14/2001 00:17:41 CDT|
|Blob database id:||11|
|Score (*):||27.2837 (normalized score 0)|
(from blob table id=11)
There are certain forms classed as
archivable: these prime may (at times)
remain on this list even if they do not make
the Top 5000 proper. Such primes are tracked with archival
- Illegal prime (tolerated *)
- Prime on list: no, rank 1
Subcategory: "Illegal prime"
(archival tag id 176262, tag last modified 2003-11-01 21:20:04)
- Elliptic Curve Primality Proof (archivable *)
- Prime on list: no, rank 655
(archival tag id 176261, tag last modified 2014-11-03 14:20:27)
The Top 5000 Primes is a list for proven primes only. In order to maintain the
integrity of this list, we seek to verify the primality of all submissions.
We are currently unable to check all proofs (ECPP, KP, ...), but we will at least trial
divide and PRP
check every entry before it is included in the list.
|machine||Linux PII 200|
|notes||PFGW Version 20020311.x86_Dev (Alpha software, 'caveat utilitor') Running N-1 test using base 2 Primality testing 1019710401...0786882659 [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N+1 test using discriminant 11, base 2+sqrt(11) Calling N-1 BLS with factored part 0.14% and helper 0.06% (0.51% proof) 1019710401...0786882659 is Fermat and Lucas PRP! (34.850000 seconds) |
Query times: 0.0002 seconds to select prime, 0.0002 seconds to seek comments.