1 - V( - 2, - 2, 3074821) - 23074821

Previous Next Random

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:1 - V( - 2, - 2, 3074821) - 23074821
Verification status (*):Proven
Official Comment (*):[none]
Unofficial Comments:This prime has 1 user comment below.
Proof-code(s): (*):p437 : Propper, Batalov, EMsieve, PIES, OpenPFGW
Decimal Digits:1342125   (log10 is 1342124.8411758)
Rank (*):694 (digit rank is 1)
Entrance Rank (*):684
Currently on list? (*):yes
Submitted:10/30/2024 18:23:07 UTC
Last modified:11/1/2024 16:37:15 UTC
Database id:138687
Status Flags:none
Score (*):47.5356 (normalized score 11.1162)

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 (30 Oct 2024):  (report abuse)
Primes of this form are "cousins" of Mersenne, Fermat, Gaussian-Mersenne and Eisenstein-Mersenne norm primes. See Mike Oakes' observations from 2002. D.Broadhurst called those extensions "Oakes primes".

The reason the primes of this form with b = -2 (like this one) and b = -3 are provable with N-1 BLS proof is that N-1 is > 33% factored:
-lucasV(-2,-2,n) = 2^k * A001834(k-1) for odd n = 2k - 1, where A001834(i) = lucasU(4,1,i)+lucasU(4,1,i+1), and
-lucasV(-3,-3,n) = 3^k * A030221(k-1) for odd n = 2k - 1, where A030221(i) = (lucasV(5,1,i+1)-lucasV(5,1,i))/3.

The A() cofactors are somewhat connected to Lehmer numbers.

Furthermore, primes in all these series are only possible with n prime. The divisors for the composite values are restricted to the form 2·K·n+1.

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


Running N-1 test using base 5
Generic modular reduction using generic reduction AVX-512 FFT length 448K, Pass1=1K, Pass2=448, clm=1 on A 4458444-bit number
Detected in MAXERR>0.45 (round off check) in Exponentiator::Iterate
Iteration: 38399/4458777 ERROR: ROUND OFF 0.47328>0.45
(Test aborted, try again using the -a1 switch)
Running N-1 test using base 29
Generic modular reduction using generic reduction AVX-512 FFT length 480K, Pass1=960, Pass2=512, clm=1 on A 4458444-bit number
Running N+1 test using discriminant 41, base 1+sqrt(41)
Generic modular reduction using generic reduction AVX-512 FFT length 448K, Pass1=1K, Pass2=448, clm=1 on A 4458444-bit number
Detected in MAXERR>0.45 (round off check) in Exponentiator::Iterate
Iteration: 40/4458444 ERROR: ROUND OFF 0.49387>0.45
(Test aborted, try again using the -a1 switch)
Running N+1 test using discriminant 41, base 1+sqrt(41)
Generic modular reduction using generic reduction AVX-512 FFT length 480K, Pass1=960, Pass2=512, clm=1 on A 4458444-bit number
Calling N-1 BLS with factored part 34.49% and helper 0.00% (103.46% proof)


1-lucasV(-2,-2,3074821)-2^3074821 is prime! (164221.5108s+0.0646s)
[Elapsed time: 1.90 days]
modified2024-11-01 16:01:03
created2024-10-30 18:24:01
id184530

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