This site will be down for maintenance beginning noon CDT (5pm UTC) Wed April 14
(283339 + 1)/3
|Description:||(283339 + 1)/3|
|Verification status (*):||PRP|
|Official Comment (*):||ECPP, generalized Lucas number, Wagstaff|
|Unofficial Comments:||This prime has 1 user comment below.|
|Proof-code(s): (*):||c54 : Wu_T, Primo|
|Decimal Digits:||25088 (log10 is 25087.061687386)|
|Rank (*):||65799 (digit rank is 2)|
|Entrance Rank (*):||56573|
|Currently on list? (*):||short|
|Submitted:||9/17/2014 12:16:24 CDT|
|Last modified:||9/17/2014 13:12:24 CDT|
|Status Flags:||Verify, TrialDiv|
|Score (*):||35.287 (normalized score 0.0001)|
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 Lucas Number (archivable *)
- Prime on list: yes, rank 12
Subcategory: "Generalized Lucas Number"
(archival tag id 217818, tag last modified 2020-05-28 13:20:28)
- Elliptic Curve Primality Proof (archivable *)
- Prime on list: yes, rank 14
(archival tag id 217819, tag last modified 2021-02-03 13:20:32)
- Wagstaff (archivable *)
- Prime on list: yes, rank 1
(archival tag id 217820, tag last modified 2014-09-17 12:50:33)
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 118512 person_id 9 machine Using: Xeon 4c+4c 3.5GHz what prp notes Command: /home/caldwell/client/pfgw/pfgw64 -tc -q"(2^83339+1)/3" 2>&1 PFGW Version 22.214.171.124BIT.20130722.x86_Dev [GWNUM 27.11] Primality testing (2^83339+1)/3 [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 2 Running N+1 test using discriminant 5, base 1+sqrt(5) Calling N+1 BLS with factored part 0.03% and helper 0.02% (0.10% proof) (2^83339+1)/3 is Fermat and Lucas PRP! (7.8406s+0.0003s) [Elapsed time: 8.00 seconds] modified 2020-07-07 17:30:17 created 2014-09-17 12:21:01 id 164091
Query times: 0.0005 seconds to select prime, 0.0008 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.