U(132409)/2882138154561602271737
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: | U(132409)/2882138154561602271737 |
|---|---|
| Verification status (*): | PRP |
| Official Comment (*): | Fibonacci cofactor, ECPP |
| Proof-code(s): (*): | E16 : Propper, Batalov, CM |
| Decimal Digits: | 27651 (log10 is 27650.035258063) |
| Rank (*): | 72511 (digit rank is 2) |
| Entrance Rank (*): | 70658 |
| Currently on list? (*): | yes |
| Submitted: | 7/27/2024 21:31:14 UTC |
| Last modified: | 7/27/2024 21:37:11 UTC |
| Database id: | 138344 |
| Status Flags: | Verify |
| Score (*): | 35.5877 (normalized score 0) |
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: no, rank 47
Subcategory: "ECPP"
(archival tag id 229605, tag last modified 2025-01-20 23:37:20)- Fibonacci cofactor (archivable *)
- Prime on list: yes, rank 1
Subcategory: "Fibonacci cofactor"
(archival tag id 229606, tag last modified 2024-07-27 21:37:12)
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 138344 person_id 9 machine Using: Digital Ocean Droplet what prp notes Command: /var/www/clientpool/1/pfgw64 -V -f -tc -q"U(132409)/2882138154561602271737" >command_output 2>&1
PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing U(132409)/2882138154...1602271737 [N-1/N+1, Brillhart-Lehmer-Selfridge]
trial
Running N-1 test using base 3
Generic modular reduction using generic reduction AVX-512 FFT length 9K on A 91852-bit number
Running N+1 test using discriminant 11, base 1+sqrt(11)
Generic modular reduction using generic reduction AVX-512 FFT length 9K on A 91852-bit number
Detected in MAXERR>0.45 (round off check) in Exponentiator::Iterate
Iteration: 91848/91902 ERROR: ROUND OFF 0.5>0.45
(Test aborted, try again using the -a1 switch)
Running N+1 test using discriminant 11, base 1+sqrt(11)
Generic modular reduction using generic reduction AVX-512 FFT length 10K on A 91852-bit number
Calling N+1 BLS with factored part 0.04% and helper 0.00% (0.12% proof)
U(132409)/2882138154...1602271737 is Fermat and Lucas PRP! (55.0449s+0.0078s)
[Elapsed time: 60.00 seconds]modified 2024-07-27 21:33:01 created 2024-07-27 21:32:01 id 184186
Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.