Some things are broken, we are working on it. Do not submit anything yet.
61267078131072 + 1
|Description:||61267078131072 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Generalized Fermat|
|Proof-code(s): (*):||L4923 : Koriabine, GFNSvCUDA, GeneFer, AthGFNSieve, PrimeGrid, LLR|
|Decimal Digits:||1020688 (log10 is 1020687.4393766)|
|Rank (*):||648 (digit rank is 1)|
|Entrance Rank (*):||362|
|Currently on list? (*):||short|
|Submitted:||6/29/2019 21:42:00 CDT|
|Last modified:||6/30/2019 04:20:12 CDT|
|Score (*):||46.6958 (normalized score 10.2786)|
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.
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 126597 person_id 9 machine Using: Xeon (pool) 4c+4c 3.5GHz what prime notes Command: /home/caldwell/clientpool/1/pfgw64 -t -q"61267078^131072+1" 2>&1 PFGW Version 184.108.40.206BIT.20130722.x86_Dev [GWNUM 27.11] Primality testing 61267078^131072+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Calling Brillhart-Lehmer-Selfridge with factored part 55.20% 61267078^131072+1 is prime! (22692.3903s+0.0331s) [Elapsed time: 6.30 hours] modified 2020-07-07 17:30:13 created 2019-06-29 21:43:01 id 172283
Query times: 0.0005 seconds to select prime, 0.0007 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.