6561 · 21143548 + 1
|Description:||6561 · 21143548 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Generalized Fermat|
|Proof-code(s): (*):||L3548 : Ready, PSieve, Srsieve, PrimeGrid, LLR|
|Decimal Digits:||344247 (log10 is 344246.06645159)|
|Rank (*):||14680 (digit rank is 1)|
|Entrance Rank (*):||2656|
|Currently on list? (*):||no|
|Submitted:||8/25/2013 18:49:53 CDT|
|Last modified:||8/26/2013 01:50:28 CDT|
|Removed (*):||5/27/2014 02:07:07 CDT|
|Score (*):||43.3582 (normalized score 0.3613)|
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 115252 person_id 9 machine RedHat P4 P4 what prime notes Command: /home/caldwell/client/pfgw -t -q"6561*2^1143548+1" 2>&1 PFGW Version 220.127.116.11BIT.20110215.x86_Dev [GWNUM 26.5] Primality testing 6561*2^1143548+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 5 Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 6561*2^1143548+1 is prime! (3634.8758s+0.0012s) [Elapsed time: 60.58 minutes] modified 2020-07-07 17:30:18 created 2013-08-26 00:48:21 id 160743
Query times: 0.0004 seconds to select prime, 0.0006 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.