primV(67, - 1, 13081)/65419672274940815357
|Description:||primV(67, - 1, 13081)/65419672274940815357|
|Verification status (*):||PRP|
|Official Comment (*):||ECPP|
|Unofficial Comments:||This prime has 1 user comment below.|
|Proof-code(s): (*):||c84 : Underwood, Primo|
|Decimal Digits:||23451 (log10 is 23450.140528386)|
|Rank (*):||67149 (digit rank is 1)|
|Entrance Rank (*):||64660|
|Currently on list? (*):||no|
|Submitted:||10/3/2019 13:53:18 CDT|
|Last modified:||10/19/2019 09:53:41 CDT|
|Status Flags:||Verify, TrialDiv|
|Score (*):||35.0784 (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 tags.
User comments about this prime (disclaimer):
User comments are allowed to convey mathematical information about this number, how it was proven prime.... See our guidelines and restrictions.
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.
field value prime_id 129988 person_id 9 machine Using: Xeon 4c+4c 3.5GHz what prp notes Command: /home/caldwell/client/pfgw/pfgw64 -tc -q"primV(67,-1,13081)/65419672274940815357" 2>&1 PFGW Version 188.8.131.52BIT.20130722.x86_Dev [GWNUM 27.11] Primality testing primV(67,-1,13081)/65419672274940815357 [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 2 Running N+1 test using discriminant 5, base 4+sqrt(5) Calling N-1 BLS with factored part 0.04% and helper 0.01% (0.13% proof) primV(67,-1,13081)/65419672274940815357 is Fermat and Lucas PRP! (39.5554s+0.0026s) [Elapsed time: 40.00 seconds] modified 2020-07-07 17:30:11 created 2019-10-03 14:01:01 id 175673
Query times: 0.0005 seconds to select prime, 0.0008 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.