primU(164185)

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:primU(164185)
Verification status (*):PRP
Official Comment (*):Fibonacci primitive part, ECPP
Unofficial Comments:This prime has 1 user comment below.
Proof-code(s): (*):E1 : Batalov, CM
Decimal Digits:23524   (log10 is 23523.512320854)
Rank (*):74653 (digit rank is 1)
Entrance Rank (*):72938
Currently on list? (*):yes
Submitted:10/3/2024 19:35:12 UTC
Last modified:10/4/2024 02:37:14 UTC
Database id:138608
Status Flags:Verify
Score (*):35.0881 (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 81
Subcategory: "ECPP"
(archival tag id 229671, tag last modified 2025-01-20 23:37:20)
Fibonacci Primitive Part (archivable *)
Prime on list: yes, rank 5
Subcategory: "Fibonacci Primitive Part"
(archival tag id 229672, tag last modified 2024-10-14 00:37:17)

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


Running N-1 test using base 19
Generic modular reduction using generic reduction FMA3 FFT length 8K, Pass1=128, Pass2=64, clm=2 on A 78144-bit number
Running N-1 test using base 37
Generic modular reduction using generic reduction FMA3 FFT length 8K, Pass1=128, Pass2=64, clm=2 on A 78144-bit number
Running N-1 test using base 47
Generic modular reduction using generic reduction FMA3 FFT length 8K, Pass1=128, Pass2=64, clm=2 on A 78144-bit number
Running N+1 test using discriminant 83, base 3+sqrt(83)
Generic modular reduction using generic reduction FMA3 FFT length 8K, Pass1=128, Pass2=64, clm=2 on A 78144-bit number
Calling N-1 BLS with factored part 0.63% and helper 0.02% (1.93% proof)


3253275583...4397560801 is Fermat and Lucas PRP! (58.0563s+0.0070s)
[Elapsed time: 60.00 seconds]
modified2024-10-04 02:04:01
created2024-10-04 02:02:55
id184452

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