Some things are broken, we are working on it. Do not submit anything yet.
(14665 · 1034110 - 56641)/9999
|Description:||(14665 · 1034110 - 56641)/9999|
|Verification status (*):||PRP|
|Official Comment (*):||ECPP, Palindrome|
|Unofficial Comments:||This prime has 2 user comments below.|
|Proof-code(s): (*):||c89 : Underwood, Broadhurst, Primo|
|Decimal Digits:||34111 (log10 is 34110.166325499)|
|Rank (*):||60707 (digit rank is 1)|
|Entrance Rank (*):||57092|
|Currently on list? (*):||short|
|Submitted:||3/29/2018 17:38:40 CDT|
|Last modified:||3/29/2018 19:20:12 CDT|
|Status Flags:||Verify, TrialDiv|
|Score (*):||36.2364 (normalized score 0.0002)|
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 124558 person_id 9 machine Using: Xeon 4c+4c 3.5GHz what prp notes Command: /home/caldwell/client/pfgw/pfgw64 -tc -q"(14665*10^34110-56641)/9999" 2>&1 PFGW Version 22.214.171.124BIT.20130722.x86_Dev [GWNUM 27.11] Primality testing (14665*10^34110-56641)/9999 [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 11 Running N+1 test using discriminant 19, base 15+sqrt(19) Calling N-1 BLS with factored part 0.03% and helper 0.03% (0.14% proof) (14665*10^34110-56641)/9999 is Fermat and Lucas PRP! (94.7432s+0.0007s) [Elapsed time: 1.58 minutes] modified 2020-07-07 17:30:15 created 2018-03-29 17:41:01 id 170223
Query times: 0.0002 seconds to select prime, 0.0029 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.