primV(154281)
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: | primV(154281) |
---|---|
Verification status (*): | PRP |
Official Comment (*): | Lucas primitive part, ECPP |
Proof-code(s): (*): | E4 : Childers, CM |
Decimal Digits: | 21495 (log10 is 21494.61269028) |
Rank (*): | 73542 (digit rank is 1) |
Entrance Rank (*): | 71477 |
Currently on list? (*): | yes |
Submitted: | 11/13/2023 17:25:06 UTC |
Last modified: | 11/13/2023 17:37:14 UTC |
Database id: | 136657 |
Status Flags: | Verify |
Score (*): | 34.8092 (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.
- Lucas primitive part (archivable *)
- Prime on list: yes, rank 8
Subcategory: "Lucas primitive part"
(archival tag id 228961, tag last modified 2024-10-11 22:37:11)- Elliptic Curve Primality Proof (archivable *)
- Prime on list: no, rank 99
Subcategory: "ECPP"
(archival tag id 228962, 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 136657 person_id 9 machine Using: Digital Ocean Droplet what prp notes PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing 4099116674...2729624311 [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 7K on A 71404-bit number
Running N-1 test using base 13
Generic modular reduction using generic reduction AVX-512 FFT length 7K on A 71404-bit number
Running N+1 test using discriminant 19, base 1+sqrt(19)
Generic modular reduction using generic reduction AVX-512 FFT length 7K on A 71404-bit number
Detected in MAXERR>0.45 (round off check) in Exponentiator::Iterate
Iteration: 71414/71466 ERROR: ROUND OFF 0.5>0.45
(Test aborted, try again using the -a1 switch)
Running N+1 test using discriminant 19, base 1+sqrt(19)
Generic modular reduction using generic reduction AVX-512 FFT length 7680 on A 71404-bit number
Calling N-1 BLS with factored part 0.63% and helper 0.06% (1.96% proof)
4099116674...2729624311 is Fermat and Lucas PRP! (43.5934s+0.0042s)
[Elapsed time: 45.00 seconds]modified 2023-11-13 17:26:51 created 2023-11-13 17:26:01 id 182492
Query times: 0.0002 seconds to select prime, 0.0002 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.