4 · 33522 + 1
|Description:||4 · 33522 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Generalized Fermat|
|Proof-code(s): (*):||C : Caldwell, Cruncher|
|Decimal Digits:||1682 (log10 is 1681.02311911398)|
|Rank (*):||101981 (digit rank is 1)|
|Entrance Rank (*):||1346|
|Currently on list? (*):||no|
|Score (*):||26.8951 (normalized score 0)|
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 38334 person_id 9 machine Linux PII 200 what prime notes PFGW Version 1.1 for Pentium and compatibles Running N-1 test using base 2 Primality testing 4*3^3522+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 5 Running N-1 test using base 7 Calling Brillhart-Lehmer-Selfridge with factored part 99.96% 4*3^3522+1 is prime! (18.420000 seconds) modified 2003-03-25 11:27:11 created 2002-12-06 00:00:05 id 19377
Query times: 0.0004 seconds to select prime, 0.0006 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.