9 · 1066886 + 1
|Description:||9 · 1066886 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Generalized Fermat|
|Proof-code(s): (*):||g375 : Benson, NewPGen, OpenPFGW, Proth.exe|
|Decimal Digits:||66887 (log10 is 66886.9542425)|
|Rank (*):||50922 (digit rank is 1)|
|Entrance Rank (*):||2029|
|Currently on list? (*):||no|
|Submitted:||12/31/2004 03:46:19 CDT|
|Last modified:||12/31/2004 03:46:19 CDT|
|Removed (*):||3/14/2006 03:37:21 CDT|
|Score (*):||38.3146 (normalized score 0.0021)|
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 72945 person_id 9 machine Linux P4 2.8GHz what prime notes Command: /home/caldwell/client/pfgw -f -t -q"9*10^66886+1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 9*10^66886+1 [N-1, Brillhart-Lehmer-Selfridge] trial factoring to 22174983 Running N-1 test using base 11 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(28672,20) to FFT(28672,19) Reduced from FFT(28672,19) to FFT(28672,18) Reduced from FFT(28672,18) to FFT(28672,17) Reduced from FFT(28672,17) to FFT(28672,16) 444396 bit request FFT size=(28672,16) Calling Brillhart-Lehmer-Selfridge with factored part 69.90% 9*10^66886+1 is prime! (702.4200s+0.0000s) modified 2020-07-07 17:30:45 created 2004-12-31 03:55:39 id 77949
Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.