2859433 - 1
|Description:||2859433 - 1|
|Verification status (*):||Proven|
|Official Comment (*):||Mersenne 33|
|Proof-code(s): (*):||SG : Slowinski, Gage|
|Decimal Digits:||258716 (log10 is 258715.11226348)|
|Rank (*):||20616 (digit rank is 1)|
|Entrance Rank (*):||1|
|Currently on list? (*):||short|
|Score (*):||42.4801 (normalized score 0.1449)|
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 23 person_id 9 machine RedHat P4 P4 what prime notes Command: /home/caldwell/client/pfgw -tp -q"2^859433-1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 2^859433-1 [N+1, Brillhart-Lehmer-Selfridge] Running N+1 test using discriminant 3, base 1+sqrt(3) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(114688,20) to FFT(114688,19) Reduced from FFT(114688,19) to FFT(114688,18) Reduced from FFT(114688,18) to FFT(114688,17) Reduced from FFT(114688,17) to FFT(114688,16) 1718882 bit request FFT size=(114688,16) Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 2^859433-1 is prime! (13568.8914s+0.0007s) [Elapsed time: 3.77 hours] modified 2020-07-07 17:30:39 created 2008-08-06 06:27:42 id 100213
Query times: 0.0002 seconds to select prime, 0.0002 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.