2139964 + 35461
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: | 2139964 + 35461 |
|---|---|
| Verification status (*): | PRP |
| Official Comment (*): | ECPP |
| Proof-code(s): (*): | E11 : Karpovich, CM |
| Decimal Digits: | 42134 (log10 is 42133.362313113) |
| Rank (*): | 64242 (digit rank is 1) |
| Entrance Rank (*): | 64168 |
| Currently on list? (*): | yes |
| Submitted: | 10/26/2024 20:28:51 UTC |
| Last modified: | 10/27/2024 10:37:09 UTC |
| Database id: | 138679 |
| Status Flags: | Verify |
| Score (*): | 36.8887 (normalized score 0.0002) |
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.
- Elliptic Curve Primality Proof (archivable *)
- Prime on list: yes, rank 10
Subcategory: "ECPP"
(archival tag id 229718, tag last modified 2024-10-27 10:37:10)
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 138679 person_id 9 machine Using: Digital Ocean Droplet what prp notes Command: /var/www/clientpool/1/pfgw64 -V -f -tc -q"2^139964+35461" >command_output 2>&1
PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing 2^139964+35461 [N-1/N+1, Brillhart-Lehmer-Selfridge]
trial
Running N-1 test using base 2
Special modular reduction using generic reduction AVX-512 FFT length 16K on 2^139964+35461
Running N+1 test using discriminant 5, base 4+sqrt(5)
Special modular reduction using generic reduction AVX-512 FFT length 16K on 2^139964+35461
Calling N-1 BLS with factored part 0.01% and helper 0.00% (0.03% proof)
2^139964+35461 is Fermat and Lucas PRP! (97.3177s+0.0008s)
[Elapsed time: 1.67 minutes]modified 2024-10-27 10:15:46 created 2024-10-27 10:14:06 id 184522
Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.