Some things are broken, we are working on it. Do not submit anything yet.
99064503957 · 2200008 - 1
|Description:||99064503957 · 2200008 - 1|
|Verification status (*):||Proven|
|Official Comment (*):||Sophie Germain (p)|
|Proof-code(s): (*):||L95 : Urushi, LLR|
|Decimal Digits:||60220 (log10 is 60219.403290831)|
|Rank (*):||52062 (digit rank is 6)|
|Entrance Rank (*):||45730|
|Currently on list? (*):||short|
|Submitted:||4/1/2016 20:38:56 CDT|
|Last modified:||4/2/2016 09:20:03 CDT|
|Score (*):||37.9908 (normalized score 0.0017)|
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 121507 person_id 9 machine Using: Xeon 4c+4c 3.5GHz what prime notes Command: /home/caldwell/client/llr.pl 99064503957*2^200008-1 2>&1 Starting Lucas Lehmer Riesel prime test of 99064503957*2^200008-1 Using zero-padded AVX FFT length 20K, Pass1=320, Pass2=64 V1 = 5 ; Computing U0... V1 = 5 ; Computing U0...done.Starting Lucas-Lehmer loop... 99064503957*2^200008-1 is prime! (60220 decimal digits) Time : 17.753 sec. [Elapsed time: 18.00 seconds] modified 2020-07-07 17:30:16 created 2016-04-01 20:41:20 id 167139
Query times: 0.0004 seconds to select prime, 0.0006 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.