(V(27730, 1, 16209) + 1)/(V(27730, 1, 9) + 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(27730, 1, 16209) + 1)/(V(27730, 1, 9) + 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:71976   (log10 is 71975.787878012)
Rank (*):57517 (digit rank is 1)
Entrance Rank (*):57514
Currently on list? (*):yes
Submitted:9/1/2025 05:37:43 UTC
Last modified:9/1/2025 22:37:10 UTC
Database id:141035
Status Flags:Verify
Score (*):38.5407 (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 239492, tag last modified 2025-09-01 22: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 (1 Sep 2025):  (report abuse)
This Lehmer primitive part is proven using CHG with N-1 factored to 25.81% and helper prime factors (p11064, p1832, etc) proven with CM, and several c1XX cofactors factored with msieve. Ryan Propper provided multiple factorizations (ECM and CADO/msieve).

Report is available. Here is a partial CHG(server) script log:

Target "LehmPrim71k" has 71976 digits.
Modulus provides 25.811095829626381336%.
Right endpoint has 16243 digits.

LLL[1, 1] for client 1 has [h, u] = [4, 1] and digits in [1, 179]
LLL[2, 1] for client 2 has [h, u] = [4, 1] and digits in [179, 508]
LLL[3, 1] for client 3 has [h, u] = [5, 1] and digits in [508, 2345]
LLL[4, 1] for client 4 has [h, u] = [5, 1] and digits in [2345, 3264]
...
LLL[107, 1] for client 107 has [h, u] = [33, 15] and digits in [16040, 16096]
LLL[108, 1] for client 108 has [h, u] = [33, 15] and digits in [16096, 16148]
LLL[109, 1] for client 109 has [h, u] = [33, 15] and digits in [16148, 16197]
LLL[110, 1] for client 110 has [h, u] = [33, 15] and digits in [16197, 16243]

LLL was split between 110 clients.
110 LLL reductions completed in ~200 CPUhours. (need ~400 GB of RAM)
...
Testing a PRP called "LehmPrim71k".

Pol[1, 1] with [h, u]=[4, 1] has ratio=3.869073761956830800 E-601 at X, ratio=4.465560051463927306 E-779 at Y, witness=61.
Pol[2, 1] with [h, u]=[4, 1] has ratio=1.7791060371286458951 E-450 at X, ratio=4.144862895605377687 E-779 at Y, witness=7.
...
Pol[108, 1] with [h, u]=[33, 15] has ratio=0.0012858314229784705081 at X, ratio=7.165881565870480742 E-788 at Y, witness=7.
Pol[109, 1] with [h, u]=[33, 15] has ratio=0.0016287186350862101064 at X, ratio=8.020449106514699983 E-739 at Y, witness=83.
Pol[110, 1] with [h, u]=[33, 15] has ratio=0.003006390388871691749 at X, ratio=7.945149204139685450 E-693 at Y, witness=23.

Validated in 346 sec.

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


Running N-1 test using base 41
Generic modular reduction using generic reduction FMA3 FFT length 24K, Pass1=384, Pass2=64, clm=2 on A 239099-bit number
Running N-1 test using base 43
Generic modular reduction using generic reduction FMA3 FFT length 24K, Pass1=384, Pass2=64, clm=2 on A 239099-bit number
Running N+1 test using discriminant 53, base 15+sqrt(53)
Generic modular reduction using generic reduction FMA3 FFT length 24K, Pass1=384, Pass2=64, clm=2 on A 239099-bit number
Calling N-1 BLS with factored part 0.56% and helper 0.00% (1.67% proof)


(lucasV(27730,1,16209)+1)/(lucasV(27730,1,9)+1) is Fermat and Lucas PRP! (469.3562s+0.0025s)
[Elapsed time: 7.85 minutes]
modified2025-09-01 21:48:20
created2025-09-01 21:40:29
id187125

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