primV(119162)

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(119162)
Verification status (*):PRP
Official Comment (*):Lucas primitive part, ECPP
Unofficial Comments:This prime has 1 user comment below.
Proof-code(s): (*):E1 : Batalov, CM
Decimal Digits:24903   (log10 is 24902.908066213)
Rank (*):72097 (digit rank is 1)
Entrance Rank (*):71999
Currently on list? (*):yes
Submitted:10/10/2024 10:39:20 UTC
Last modified:10/10/2024 23:37:21 UTC
Database id:138631
Status Flags:Verify
Score (*):35.2642 (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 3
Subcategory: "Lucas primitive part"
(archival tag id 229686, tag last modified 2024-10-11 22:37:11)
Elliptic Curve Primality Proof (archivable *)
Prime on list: no, rank 64
Subcategory: "ECPP"
(archival tag id 229687, tag last modified 2024-10-27 10:37:10)

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.
fieldvalue
prime_id138631
person_id9
machineUsing: Digital Ocean Droplet
whatprp
notesPFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing 8092192646...8138231601 [N-1/N+1, Brillhart-Lehmer-Selfridge]
trial


Running N-1 test using base 7
Generic modular reduction using generic reduction FMA3 FFT length 8K, Pass1=128, Pass2=64, clm=2 on A 82726-bit number
Running N-1 test using base 13
Generic modular reduction using generic reduction FMA3 FFT length 8K, Pass1=128, Pass2=64, clm=2 on A 82726-bit number
Running N+1 test using discriminant 23, base 3+sqrt(23)
Generic modular reduction using generic reduction FMA3 FFT length 8K, Pass1=128, Pass2=64, clm=2 on A 82726-bit number
Detected in MAXERR>0.45 (round off check) in Exponentiator::Iterate
Iteration: 82820/83223 ERROR: ROUND OFF 0.46875>0.45
(Test aborted, try again using the -a1 switch)
Running N+1 test using discriminant 23, base 3+sqrt(23)
Generic modular reduction using generic reduction FMA3 FFT length 10K, Pass1=128, Pass2=80, clm=2 on A 82726-bit number
Calling N-1 BLS with factored part 0.48% and helper 0.17% (1.62% proof)


8092192646...8138231601 is Fermat and Lucas PRP! (76.7316s+0.0045s)
[Elapsed time: 80.00 seconds]
modified2024-10-10 23:35:24
created2024-10-10 23:33:59
id184475

Query times: 0.0002 seconds to select prime, 0.0006 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.