(V(24444, 1, 10809) + 1)/(V(24444, 1, 9) + 1)

This prime's information:

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 5
Subcategory: "Lehmer primitive part"
(archival tag id 239481, 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 (24 Aug 2025):  (report abuse)

This Lehmer primitive part is proven using CHG with N-1 factored to 26.30% and helper prime factors (p7891, p981) proven with CM. Report is available. Here is a partial CHG(server) script log: Target "LehmPrim47k" has 47393 digits. Modulus provides 26.298485548471717930%. Right endpoint has 10003 digits. LLL[1, 1] for client 1 has [h, u] = [4, 1] and digits in [1, 267] LLL[2, 1] for client 2 has [h, u] = [5, 1] and digits in [267, 1626] LLL[3, 1] for client 3 has [h, u] = [5, 1] and digits in [1626, 2305] ... LLL[64, 1] for client 64 has [h, u] = [20, 9] and digits in [9792, 9859] LLL[65, 1] for client 65 has [h, u] = [21, 9] and digits in [9859, 9935] LLL[66, 1] for client 66 has [h, u] = [21, 9] and digits in [9935, 10003] LLL was split between 66 clients. 66 LLL reductions completed in 68.85027777777777778 CPUhours. ... Please wait, while the certificate is saved... A certificate was saved in file "LehmPrim47k_cert.gp". ... Pol[64, 1] with [h, u]=[20, 9] has ratio=0.015312731224937724753 at X, ratio=4.485579572690880800 E-609 at Y, witness=89. Pol[65, 1] with [h, u]=[21, 9] has ratio=0.012951208647674430285 at X, ratio=7.104029840996426403 E-682 at Y, witness=7. Pol[66, 1] with [h, u]=[21, 9] has ratio=0.018098596442382014374 at X, ratio=7.052951783314649595 E-614 at Y, witness=73. Validated in 70 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.