3 · 22045208 - 3 · 21022604 + 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 · 22045208 - 3 · 21022604 + 1 |
|---|---|
| Verification status (*): | Proven |
| Official Comment (*): | Generalized unique |
| Proof-code(s): (*): | A3 : Atnashev, PRST |
| Decimal Digits: | 615670 (log10 is 615669.43249319) |
| Rank (*): | 4978 (digit rank is 1) |
| Entrance Rank (*): | 4249 |
| Currently on list? (*): | yes |
| Submitted: | 12/3/2023 05:13:16 UTC |
| Last modified: | 3/31/2024 19:27:08 UTC |
| Database id: | 136718 |
| Status Flags: | none |
| Score (*): | 45.1442 (normalized score 1.0164) |
Archival tags:
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 Unique (archivable *)
- Prime on list: no, rank 57
Subcategory: "Generalized Unique"
(archival tag id 229008, tag last modified 2023-12-18 15:37:22)
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 136718 person_id 9 machine Using: Digital Ocean Droplet what prime notes Command: /var/www/clientpool/1/pfgw64 -V -f -tc -q"Phi(3,-3*2^1022604+1)/3" >command_output 2>&1
PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing Phi(3,-3*2^1022604+1)/3 [N-1/N+1, Brillhart-Lehmer-Selfridge]
trial
Running N-1 test using base 11
Generic modular reduction using generic reduction AVX-512 FFT length 240K, Pass1=640, Pass2=384, clm=1 on A 2045212-bit number
Running N-1 test using base 17
Generic modular reduction using generic reduction AVX-512 FFT length 240K, Pass1=640, Pass2=384, clm=1 on A 2045212-bit number
Running N-1 test using base 19
Generic modular reduction using generic reduction AVX-512 FFT length 240K, Pass1=640, Pass2=384, clm=1 on A 2045212-bit number
Running N+1 test using discriminant 29, base 10+sqrt(29)
Generic modular reduction using generic reduction AVX-512 FFT length 240K, Pass1=640, Pass2=384, clm=1 on A 2045212-bit number
Calling N-1 BLS with factored part 50.04% and helper 0.00% (150.11% proof)
Phi(3,-3*2^1022604+1)/3 is prime! (58659.2455s+0.0441s)
[Elapsed time: 16.29 hours]modified 2023-12-04 11:24:27 created 2023-12-03 19:06:46 id 182553
Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.