3 · 220928756 - 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: | 3 · 220928756 - 1 |
|---|---|
| Verification status (*): | Proven |
| Official Comment (*): | [none] |
| Unofficial Comments: | This prime has 1 user comment below. |
| Proof-code(s): (*): | L5799 : Lehmann1, LLR2, Srsieve, PrimeGrid, LLR |
| Decimal Digits: | 6300184 (log10 is 6300183.8050538) |
| Rank (*): | 25 (digit rank is 1) |
| Entrance Rank (*): | 19 |
| Currently on list? (*): | yes |
| Submitted: | 7/6/2023 20:27:31 UTC |
| Last modified: | 7/16/2023 23:37:18 UTC |
| Database id: | 136240 |
| Status Flags: | none |
| Score (*): | 52.2731 (normalized score 1264.9728) |
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.
Verification data:
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 136240 person_id 9 machine Using: Digital Ocean Droplet what prime notes Command: /var/www/clientpool/1/pfgw64 -V -f -tp -q"3*2^20928756-1" 2>&1
PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing 3*2^20928756-1 [N+1, Brillhart-Lehmer-Selfridge]
trial
Running N+1 test using discriminant 5, base 1+sqrt(5)
Special modular reduction using FMA3 FFT length 1120K, Pass1=448, Pass2=2560, clm=2 on 3*2^20928756-1
Detected in MAXERR>0.45 (round off check) in Exponentiator::Iterate
Iteration: 66/20928759 ERROR: ROUND OFF 0.46875>0.45
(Test aborted, try again using the -a1 switch)
Running N+1 test using discriminant 5, base 1+sqrt(5)
Special modular reduction using FMA3 FFT length 1152K, Pass1=384, Pass2=3K, clm=2 on 3*2^20928756-1
Calling Brillhart-Lehmer-Selfridge with factored part 100.00%
3*2^20928756-1 is prime! (855400.6868s+0.0089s)
[Elapsed time: 9.90 days]modified 2023-07-16 23:13:49 created 2023-07-07 01:37:08 id 182071
Query times: 0.0003 seconds to select prime, 0.0004 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.