primV(111534, 1, 27000)
|Description:||primV(111534, 1, 27000)|
|Verification status (*):||PRP|
|Official Comment (*):||Generalized Lucas primitive part|
|Unofficial Comments:||This prime has 1 user comment below.|
|Proof-code(s): (*):||x25 : Broadhurst, Water, OpenPFGW, Primo|
|Decimal Digits:||72683 (log10 is 72682.664799838)|
|Rank (*):||49821 (digit rank is 1)|
|Entrance Rank (*):||38122|
|Currently on list? (*):||short|
|Submitted:||11/15/2013 07:01:15 CDT|
|Last modified:||11/15/2013 08:21:21 CDT|
|Status Flags:||Verify, TrialDiv|
|Score (*):||38.5708 (normalized score 0.0028)|
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 116319 person_id 9 machine Ditto P4 P4 what prp notes Command: /home/ditto/client/pfgw -tc -q"primV(111534,1,27000)" 2>&1 PFGW Version 184.108.40.206BIT.20110215.x86_Dev [GWNUM 26.5] Primality testing primV(111534,1,27000) [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 13 Running N-1 test using base 41 Running N+1 test using discriminant 59, base 4+sqrt(59) Calling N-1 BLS with factored part 0.81% and helper 0.01% (2.43% proof) primV(111534,1,27000) is Fermat and Lucas PRP! (2843.2577s+0.3164s) [Elapsed time: 47.38 minutes] modified 2020-07-07 17:30:18 created 2013-11-15 07:08:02 id 161825
Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.