U(54381, 1, 19426) + U(54381, 1, 19425)

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:U(54381, 1, 19426) + U(54381, 1, 19425)
Verification status (*):PRP
Official Comment (*):Lehmer number
Unofficial Comments:This prime has 1 user comment below.
Proof-code(s): (*):CH15 : Propper, Batalov, CM, OpenPFGW, CHG
Decimal Digits:91987   (log10 is 91986.061660562)
Rank (*):55332 (digit rank is 2)
Entrance Rank (*):55305
Currently on list? (*):yes
Submitted:10/5/2025 02:00:19 UTC
Last modified:10/5/2025 02:37:12 UTC
Database id:141126
Status Flags:Verify
Score (*):39.2968 (normalized score 0.0017)

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 number (archivable *)
Prime on list: yes, rank 3
Subcategory: "Lehmer number"
(archival tag id 239543, tag last modified 2025-10-06 19:37:13)

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 (6 Oct 2025):  (report abuse)
This Lehmer prime number is proven using CHG with N-1 factored to 24.50% and N+1 factored to 1.40%. p20401 is proven with CM.

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

Target "Lehm91k" has 91987 digits.
Modulus provides 25.896593971553478800%.
Right endpoint has 21812 digits.

LLL[1, 1] for client 1 has [h, u] = [4, 1] and digits in [1, 299]
LLL[1, 2] for client 2 has [h, u] = [4, 1] and digits in [1, 299]
LLL[2, 1] for client 3 has [h, u] = [5, 1] and digits in [299, 2861]
...
LLL[106, 2] for client 212 has [h, u] = [32, 15] and digits in [21613, 21714]
LLL[107, 1] for client 213 has [h, u] = [32, 15] and digits in [21714, 21812]
LLL[107, 2] for client 214 has [h, u] = [32, 15] and digits in [21714, 21812]

LLL was split between 214 clients.

LLL[106, 2] with [h, u]=[32, 15] took 25569 seconds on client "212". Witness=211. Good reduction. Norm/bound=0.007716693476508143341 is small. Looks GOOD.
LLL[107, 1] with [h, u]=[32, 15] took 62032 seconds on client "213". Witness=5. Good reduction. Norm/bound=0.007795447449600922942 is small. Looks GOOD.
LLL[107, 2] with [h, u]=[32, 15] took 29627 seconds on client "214". Witness=229. Good reduction. Norm/bound=0.007880720484960888687 is small. Looks GOOD.

214 LLL reductions completed in 681.9491666666666667 CPUhours.

Testing a PRP called "Lehm91k".

Pol[1, 1] with [h, u]=[4, 1] has ratio=1.1392563955700639431 E-378 at X, ratio=2.5379995504107024639 E-676 at Y, witness=2.
Pol[2, 1] with [h, u]=[5, 1] has ratio=0.2542806231040267486 at X, ratio=8.595429185697643131 E-2564 at Y, witness=5.
Pol[3, 1] with [h, u]=[5, 1] has ratio=0.16886805560997236997 at X, ratio=1.4426477198637210481 E-1282 at Y, witness=37.
...
Pol[105, 2] with [h, u]=[32, 15] has ratio=0.0005544030473157306479 at X, ratio=1.9758111587654577760 E-1564 at Y, witness=47.
Pol[106, 2] with [h, u]=[32, 15] has ratio=0.0006101172108903036960 at X, ratio=5.248916274872829591 E-1514 at Y, witness=211.
Pol[107, 2] with [h, u]=[32, 15] has ratio=0.003191152566398583674 at X, ratio=2.9959776234489176833 E-1465 at Y, witness=229.

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


Running N-1 test using base 2
Generic modular reduction using generic reduction FMA3 FFT length 30K, Pass1=640, Pass2=48, clm=2 on A 305572-bit number
Running N-1 test using base 3
Generic modular reduction using generic reduction FMA3 FFT length 30K, Pass1=640, Pass2=48, clm=2 on A 305572-bit number
Running N+1 test using discriminant 13, base 2+sqrt(13)
Generic modular reduction using generic reduction FMA3 FFT length 30K, Pass1=640, Pass2=48, clm=2 on A 305572-bit number
Detected in MAXERR>0.45 (round off check) in Exponentiator::Iterate
Iteration: 728/308527 ERROR: ROUND OFF 0.46094>0.45
(Test aborted, try again using the -a1 switch)
Running N+1 test using discriminant 13, base 2+sqrt(13)
Generic modular reduction using generic reduction FMA3 FFT length 32K, Pass1=512, Pass2=64, clm=2 on A 305572-bit number
Detected in MAXERR>0.45 (round off check) in Exponentiator::Iterate
Iteration: 245/308527 ERROR: ROUND OFF 0.5>0.45
(Test aborted, try again using the -a2 (or possibly -a0) switch)
Running N+1 test using discriminant 13, base 2+sqrt(13)
Generic modular reduction using generic reduction FMA3 FFT length 36K, Pass1=768, Pass2=48, clm=2 on A 305572-bit number
Calling N+1 BLS with factored part 0.18% and helper 0.17% (0.71% proof)


lucasU(54381,1,19426)+lucasU(54381,1,19425) is Fermat and Lucas PRP! (804.3993s+0.0098s)
[Elapsed time: 13.42 minutes]
modified2025-10-05 02:14:27
created2025-10-05 02:01:02
id187216

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