29505368131072 + 1
|Description:||29505368131072 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Generalized Fermat|
|Proof-code(s): (*):||L5378 : Seeley, GFNSvCUDA, GeneFer, AthGFNSieve, PrimeGrid, LLR|
|Decimal Digits:||979095 (log10 is 979094.86854639)|
|Rank (*):||1238 (digit rank is 1)|
|Entrance Rank (*):||1088|
|Currently on list? (*):||short|
|Submitted:||7/20/2021 07:56:48 CDT|
|Last modified:||7/20/2021 14:37:15 CDT|
|Score (*):||46.5682 (normalized score 8.2437)|
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 132524 person_id 9 machine Using: Xeon (pool) 4c+4c 3.5GHz what prime notes Command: /home/caldwell/clientpool/1/pfgw64 -t -q"29505368^131072+1" 2>&1
PFGW Version 18.104.22.168BIT.20191203.x86_Dev [GWNUM 29.8]
Primality testing 29505368^131072+1 [N-1, Brillhart-Lehmer-Selfridge]
F: 29505368^131072+1 63488/10306868 (trial factor to 385698437)
F: 29505368^131072+1 126976/10306868 (trial factor to 385698437)
Running N-1 test using base 3
Calling Brillhart-Lehmer-Selfridge with factored part 87.91%
29505368^131072+1 is prime! (22694.3675s+0.0274s)
[Elapsed time: 6.30 hours]
modified 2021-07-20 14:29:16 created 2021-07-20 08:11:01 id 178237
Query times: 0.0002 seconds to select prime, 0.0002 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.