256 · 11771408 + 1
|Description:||256 · 11771408 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Generalized Fermat|
|Proof-code(s): (*):||L3802 : Aggarwal, Srsieve, LLR|
|Decimal Digits:||803342 (log10 is 803341.0567125)|
|Rank (*):||1328 (digit rank is 1)|
|Entrance Rank (*):||188|
|Currently on list? (*):||short|
|Submitted:||9/16/2014 17:08:07 CDT|
|Last modified:||9/16/2014 18:20:23 CDT|
|Score (*):||45.961 (normalized score 5.3793)|
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 118510 person_id 9 machine Using: Xeon 4c+4c 3.5GHz what prime notes Command: /home/caldwell/client/pfgw/pfgw64 -t -q"256*11^771408+1" 2>&1 PFGW Version 220.127.116.11BIT.20130722.x86_Dev [GWNUM 27.11] Primality testing 256*11^771408+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 256*11^771408+1 is prime! (2953.8394s+0.0269s) [Elapsed time: 49.23 minutes] modified 2020-07-07 17:30:17 created 2014-09-16 17:11:01 id 164089
Query times: 0.0021 seconds to select prime, 0.0006 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.