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:||(212391 + 1)/3|
|Verification status (*):||PRP|
|Official Comment:||Generalized Lucas number, Wagstaff|
|Proof-code(s): (*):||M : Morain|
|Decimal Digits:||3730 (log10 is 3729.58555501767)|
|Rank (*):||84786 (digit rank is 1)|
|Entrance Rank (*):||1681|
|Currently on list? (*):||short|
|Score (*):||29.3779 (normalized score 0)|
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
- Generalized Lucas Number (archivable *)
- Prime on list: no, rank 85
Subcategory: "Generalized Lucas Number"
(archival tag id 181333, tag last modified 2016-05-02 05:50:25)
- Wagstaff (archivable *)
- Prime on list: yes, rank 4
(archival tag id 181334, tag last modified 2014-09-17 12:50:33)
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 (2^12391+1)/3 [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Running N+1 test using discriminant 7, base 1+sqrt(7) Calling N-1 BLS with factored part 2.69% and helper 0.19% (8.28% proof) (2^12391+1)/3 is Fermat and Lucas PRP! (216.150000 seconds) |
Query times: 0.0005 seconds to select prime, 0.0007 seconds to seek comments.