386892131072 + 1
|Description:||386892131072 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Generalized Fermat|
|Proof-code(s): (*):||p259 : Underbakke, GenefX64, AthGFNSieve, OpenPFGW|
|Decimal Digits:||732377 (log10 is 732376.56366538)|
|Rank (*):||1580 (digit rank is 1)|
|Entrance Rank (*):||47|
|Currently on list? (*):||short|
|Submitted:||10/14/2009 21:35:43 CDT|
|Last modified:||10/16/2009 03:20:20 CDT|
|Score (*):||45.6771 (normalized score 4.0499)|
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 90471 person_id 9 machine Ditto P4 P4 what prime notes Command: /home/ditto/client/pfgw -t -q"386892^131072+1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 386892^131072+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 5 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(327680,19) to FFT(327680,18) Reduced from FFT(327680,18) to FFT(327680,17) Reduced from FFT(327680,17) to FFT(327680,16) 4865814 bit request FFT size=(327680,16) Calling Brillhart-Lehmer-Selfridge with factored part 53.51% 386892^131072+1 is prime! (105661.9220s+0.1560s) [Elapsed time: 29.35 hours] modified 2020-07-07 17:30:37 created 2009-10-14 21:38:01 id 110315
field value prime_id 90471 person_id 9 machine RedHat P4 P4 what trial_divided notes Command: /home/caldwell/client/TrialDiv/TrialDiv -q 1 386892 131072 1 2>&1 [Elapsed time: 8.183 seconds] modified 2020-07-07 17:30:37 created 2009-10-14 21:48:01 id 110316
Query times: 0.0017 seconds to select prime, 0.0006 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.