>>> New web page format problems? suggestions?
(2474115073 - 1)/24740
|Description:||(2474115073 - 1)/24740|
|Verification status (*):||PRP|
|Official Comment (*):||Generalized repunit|
|Unofficial Comments:||This prime has 1 user comment below.|
|Proof-code(s): (*):||p170 : Wu_T, Primo, OpenPFGW|
|Decimal Digits:||66218 (log10 is 66217.584798744)|
|Rank (*):||49444 (digit rank is 1)|
|Entrance Rank (*):||49233|
|Currently on list? (*):||short|
|Submitted:||7/31/2020 17:16:43 CDT|
|Last modified:||7/31/2020 17:50:16 CDT|
|Status Flags:||Verify, TrialDiv|
|Score (*):||38.2836 (normalized score 0.0026)|
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.
User comments about this prime (disclaimer):
User comments are allowed to convey mathematical information about this number, how it was proven prime.... See our guidelines and restrictions.
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 131044 person_id 9 machine Using: Xeon (pool) 4c+4c 3.5GHz what prp notes Command: /home/caldwell/clientpool/1/pfgw64 -tc -q"(24741^15073-1)/24740" 2>&1
PFGW Version 126.96.36.199BIT.20191203.x86_Dev [GWNUM 29.8]
Primality testing (24741^15073-1)/24740 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 5
Running N+1 test using discriminant 11, base 1+sqrt(11)
Calling N-1 BLS with factored part 0.18% and helper 0.00% (0.53% proof)
(24741^15073-1)/24740 is Fermat and Lucas PRP! (420.0020s+0.0098s)
[Elapsed time: 7.02 minutes]
modified 2020-07-31 17:28:02 created 2020-07-31 17:21:01 id 176732
Query times: 0.0004 seconds to select prime, 0.0008 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.