U(65181, 1, 20770) + U(65181, 1, 20769)

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(65181, 1, 20770) + U(65181, 1, 20769)
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:99985   (log10 is 99984.479449816)
Rank (*):54569 (digit rank is 1)
Entrance Rank (*):54560
Currently on list? (*):yes
Submitted:9/24/2025 17:52:07 UTC
Last modified:9/25/2025 10:37:10 UTC
Database id:141099
Status Flags:Verify
Score (*):39.5538 (normalized score 0.0022)

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 1
Subcategory: "Lehmer number"
(archival tag id 239525, tag last modified 2025-09-25 10: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 Sep 2025):  (report abuse)
This Lehmer prime number is proven using CHG with N-1 factored to 27.11% and N+1 factored to 1.53%. p26668=gcd(primU(65181,1,20769),lucasU(65181,1,10385)+lucasU(65181,1,10384))/835079951/15979773358837 is proven with CM. Ryan Propper provided massive PRP screening.

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

Target "Lehmer99k" has 99985 digits.
Modulus provides 28.595466308379280922%.
Right endpoint has 15726 digits.

LLL[1, 1] for client 1 has [h, u] = [4, 1] and digits in [1, 1382]
LLL[1, 2] for client 2 has [h, u] = [4, 1] and digits in [1, 1382]
LLL[2, 1] for client 3 has [h, u] = [4, 1] and digits in [1382, 3318]
LLL[2, 2] for client 4 has [h, u] = [4, 1] and digits in [1382, 3318]
...
LLL[16, 1] for client 31 has [h, u] = [8, 3] and digits in [14752, 15726]
LLL[16, 2] for client 32 has [h, u] = [8, 3] and digits in [14752, 15726]

LLL was split between 32 clients.

32 LLL reductions completed in 0.12638888888888888889 CPUhours.

Testing a PRP called "Lehmer99k".

Pol[1, 1] with [h, u]=[4, 1] has ratio=6.588416153674875427 E-2908 at X, ratio=2.8019309299177605588 E-4289 at Y, witness=3.
Pol[2, 1] with [h, u]=[4, 1] has ratio=1.1772432977315995778 E-2353 at X, ratio=3.412127457194838157 E-4289 at Y, witness=11.
...
Pol[15, 2] with [h, u]=[8, 3] has ratio=3.565801262287514974 E-1393 at X, ratio=6.221712361297948031 E-3665 at Y, witness=13.
Pol[16, 2] with [h, u]=[8, 3] has ratio=0.030975925629637969454 at X, ratio=1.5793450053680898454 E-2922 at Y, witness=13.

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


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


lucasU(65181,1,20770)+lucasU(65181,1,20769) is Fermat and Lucas PRP! (1053.6747s+0.0063s)
[Elapsed time: 17.60 minutes]
modified2025-09-25 10:11:02
created2025-09-25 09:53:26
id187189

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