11 · 2886071 + 1
|Description:||11 · 2886071 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Divides GF(886070,12)|
|Proof-code(s): (*):||g277 : Eaton, NewPGen, PRP, Proth.exe|
|Decimal Digits:||266735 (log10 is 266734.990680665)|
|Rank (*):||19059 (digit rank is 1)|
|Entrance Rank (*):||85|
|Currently on list? (*):||no|
|Submitted:||2/6/2005 07:30:14 CDT|
|Last modified:||2/6/2005 07:30:14 CDT|
|Score (*):||42.574 (normalized score 0.1821)|
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 73373 person_id 9 machine Linux P4 2.8GHz what prime notes Command: /home/caldwell/client/pfgw -f -t -q"11*2^886071+1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 11*2^886071+1 [N-1, Brillhart-Lehmer-Selfridge] trial factoring to 97010287 Running N-1 test using base 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) 1772158 bit request FFT size=(114688,16) Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 11*2^886071+1 is prime! (-1293.6246s+0.0000s) modified 2020-07-07 17:30:44 created 2005-02-06 07:53:01 id 78389
Query times: 0.0003 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.