5041 · 2612148 + 1
At this site we maintain a list of the 5000 Largest Known Primes which is updated hourly. This list is the most important PrimePages database: a collection of research, records and results all about prime numbers. This page summarizes our information about one of these primes.
This prime's information:
|Description:||5041 · 2612148 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Generalized Fermat|
|Proof-code(s): (*):||L1320 : Fredriksen, PSieve, Srsieve, PrimeGrid, LLR|
|Decimal Digits:||184279 (log10 is 184278.61230241)|
|Rank (*):||34477 (digit rank is 1)|
|Entrance Rank (*):||4876|
|Currently on list? (*):||no|
|Submitted:||1/25/2011 15:05:46 UTC|
|Last modified:||3/11/2023 15:54:10 UTC|
|Removed (*):||1/29/2011 17:12:45 UTC|
|Score (*):||41.4364 (normalized score 0.035)|
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.
- Generalized Fermat (archivable *)
- Prime on list: no, rank 3843
Subcategory: "Generalized Fermat"
(archival tag id 213099, tag last modified 2023-06-01 01:37:18)
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 97689 person_id 9 machine RedHat P4 P4 what trial_divided notes Command: /home/caldwell/client/TrialDiv/TrialDiv -q 5041 2 612148 1 2>&1 [Elapsed time: 10.131 seconds] modified 2020-07-07 22:30:32 created 2011-01-25 15:22:34 id 124787
field value prime_id 97689 person_id 9 machine Ditto P4 P4 what prime notes Command: /home/ditto/client/pfgw -t -q"5041*2^612148+1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 5041*2^612148+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(81920,20) to FFT(81920,19) Reduced from FFT(81920,19) to FFT(81920,18) Reduced from FFT(81920,18) to FFT(81920,17) Reduced from FFT(81920,17) to FFT(81920,16) 1224330 bit request FFT size=(81920,16) Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 5041*2^612148+1 is prime! (-1977.1473s+0.0000s) [Elapsed time: 41.52 minutes] modified 2020-07-07 22:30:32 created 2011-01-25 17:17:45 id 124797
Query times: 0.0002 seconds to select prime, 0.0004 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.