3025 · 2536810 + 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:||3025 · 2536810 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Generalized Fermat|
|Proof-code(s): (*):||L1539 : Dietsch, PSieve, Srsieve, PrimeGrid, LLR|
|Decimal Digits:||161600 (log10 is 161599.39269776)|
|Rank (*):||37668 (digit rank is 1)|
|Entrance Rank (*):||4519|
|Currently on list? (*):||no|
|Submitted:||7/31/2010 04:47:51 UTC|
|Last modified:||3/11/2023 15:54:10 UTC|
|Removed (*):||9/3/2010 02:51:20 UTC|
|Score (*):||41.0322 (normalized score 0.0233)|
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 3874
Subcategory: "Generalized Fermat"
(archival tag id 210798, tag last modified 2023-06-03 15:37:36)
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 93956 person_id 9 machine RedHat P4 P4 what trial_divided notes Command: /home/caldwell/client/TrialDiv/TrialDiv -q 3025 2 536810 1 2>&1 [Elapsed time: 9.664 seconds] modified 2020-07-07 22:30:34 created 2010-07-31 04:48:01 id 117292
field value prime_id 93956 person_id 9 machine Ditto P4 P4 what prime notes Command: /home/ditto/client/pfgw -t -q"3025*2^536810+1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 3025*2^536810+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(65536,20) to FFT(65536,19) Reduced from FFT(65536,19) to FFT(65536,18) Reduced from FFT(65536,18) to FFT(65536,17) 1073652 bit request FFT size=(65536,17) Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 3025*2^536810+1 is prime! (1480.6400s+0.0000s) [Elapsed time: 25.25 minutes] modified 2020-07-07 22:30:34 created 2010-07-31 05:08:01 id 117300
Query times: 0.0003 seconds to select prime, 0.0018 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.