(V(6489, 1, 18903) - 1)/(V(6489, 1, 3) - 1)

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:(V(6489, 1, 18903) - 1)/(V(6489, 1, 3) - 1)
Verification status (*):PRP
Official Comment (*):Lehmer primitive part
Unofficial Comments:This prime has 1 user comment below.
Proof-code(s): (*):CH15 : Propper, Batalov, CM, OpenPFGW, CHG
Decimal Digits:72051   (log10 is 72050.159736665)
Rank (*):57549 (digit rank is 1)
Entrance Rank (*):57546
Currently on list? (*):yes
Submitted:9/16/2025 23:17:46 UTC
Last modified:9/17/2025 05:37:10 UTC
Database id:141077
Status Flags:Verify
Score (*):38.5439 (normalized score 0.0008)

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.
Lehmer primitive part (archivable *)
Prime on list: yes, rank 1
Subcategory: "Lehmer primitive part"
(archival tag id 239507, tag last modified 2025-09-17 05:37:12)

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.

Serge Batalov writes (16 Sep 2025):  (report abuse)
This Lehmer primitive part is proven using CHG with N-1 factored to 25.77% and helper prime factors (p11377, p878, etc) proven with CM, and several c1XX-c200 cofactors factored with msieve. Ryan Propper provided multiple factorizations (ECM and CADO/msieve).

Report is available. Here is a partial CHG(server) script log (note: some steps required up to 0.8TB of RAM):

Target "LehmPrim72k" has 72051 digits.
Modulus provides 25.772172427521467794%.
Right endpoint has 16344 digits.

LLL[1, 1] for client 1 has [h, u] = [5, 1] and digits in [1, 1755]
LLL[2, 1] for client 2 has [h, u] = [5, 1] and digits in [1755, 2957]
LLL[3, 1] for client 3 has [h, u] = [5, 1] and digits in [2957, 3558]
...
LLL[114, 1] for client 114 has [h, u] = [35, 16] and digits in [16243, 16295]
LLL[115, 1] for client 115 has [h, u] = [35, 16] and digits in [16295, 16344]

LLL was split between 115 clients.

115 LLL reductions completed in 175.20638888888888889 CPUhours.

Testing a PRP called "LehmPrim72k".

Pol[1, 1] with [h, u]=[5, 1] has ratio=1.4206438359536430380 E-651 at X, ratio=3.080018681174045757 E-2405 at Y, witness=7.
Pol[2, 1] with [h, u]=[5, 1] has ratio=0.3475341231783464098 at X, ratio=3.759656678453443866 E-1203 at Y, witness=37.
Pol[3, 1] with [h, u]=[4, 1] has ratio=3.928231616037414454 E-142 at X, ratio=2.8855236089096952114 E-742 at Y, witness=13.
...
Pol[113, 1] with [h, u]=[35, 16] has ratio=0.0005106675678802286202 at X, ratio=1.5805160473546132598 E-893 at Y, witness=97.
Pol[114, 1] with [h, u]=[35, 16] has ratio=0.00010234000951571950916 at X, ratio=4.623890263621316011 E-841 at Y, witness=263.
Pol[115, 1] with [h, u]=[35, 16] has ratio=0.00023209675552088130115 at X, ratio=6.685573376960793416 E-792 at Y, witness=1279.

Validated in 344 sec.

A certificate was saved in file "LehmPrim72k_cert.gp".

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_id141077
person_id9
machineUsing: Digital Ocean Droplet
whatprp
notesCommand: /var/www/clientpool/1/pfgw64 -V -f -tc -q"(lucasV(6489,1,18903)-1)/(lucasV(6489,1,3)-1)" >command_output 2>&1
PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing (lucasV(6489,1,18903)-1)/(lucasV(6489,1,3)-1) [N-1/N+1, Brillhart-Lehmer-Selfridge]
trial


Running N-1 test using base 19
Generic modular reduction using generic reduction FMA3 FFT length 24K, Pass1=384, Pass2=64, clm=2 on A 239346-bit number
Running N-1 test using base 23
Generic modular reduction using generic reduction FMA3 FFT length 24K, Pass1=384, Pass2=64, clm=2 on A 239346-bit number
Running N+1 test using discriminant 43, base 9+sqrt(43)
Generic modular reduction using generic reduction FMA3 FFT length 24K, Pass1=384, Pass2=64, clm=2 on A 239346-bit number
Calling N-1 BLS with factored part 0.54% and helper 0.01% (1.64% proof)


(lucasV(6489,1,18903)-1)/(lucasV(6489,1,3)-1) is Fermat and Lucas PRP! (439.4462s+0.0040s)
[Elapsed time: 7.33 minutes]
modified2025-09-17 05:29:42
created2025-09-17 05:22:22
id187167

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