Migration complete - please let us know if anything isn't working.
33 · 21130884 + 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:||33 · 21130884 + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Divides GF(1130881,12)|
|Proof-code(s): (*):||L165 : Keiser, NewPGen, OpenPFGW, LLR|
|Decimal Digits:||340432 (log10 is 340431.5241304)|
|Rank (*):||18187 (digit rank is 2)|
|Entrance Rank (*):||107|
|Currently on list? (*):||no|
|Submitted:||7/7/2006 23:20:42 UTC|
|Last modified:||3/11/2023 15:54:10 UTC|
|Score (*):||43.324 (normalized score 0.2349)|
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 Divisors (bases 3,5,6,10,12) (archivable *)
- Prime on list: no, rank 22, weight 46.820521712702
Subcategory: "Divides GF(*,12)"
(archival tag id 187100, tag last modified 2023-03-31 01:37:05)
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 78090 person_id 9 machine GenToo P3 400MHz what trial_divided notes Command: /home/caldwell/client/TrialDiv/TrialDiv -q 33 2 1130884 1 2>&1 [Elapsed time: 9.749 seconds] modified 2020-07-07 22:30:42 created 2006-07-07 23:22:02 id 85276
field value prime_id 78090 person_id 9 machine RedHat P4 P4 what prime notes Command: /home/caldwell/client/pfgw -t -q"33*2^1130884+1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 33*2^1130884+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 19 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(131072,20) to FFT(131072,19) Reduced from FFT(131072,19) to FFT(131072,18) 2261788 bit request FFT size=(131072,18) Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 33*2^1130884+1 is prime! (-2146.7446s+0.0000s) [Elapsed time: 6444 seconds] modified 2020-07-07 22:30:42 created 2006-07-07 23:23:01 id 85277
Query times: 0.0003 seconds to select prime, 0.0006 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.