37674760044125 · 21513679 - 67931

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.

Description:37674760044125 · 21513679 - 67931
Verification status (*):Proven
Official Comment (*):[none]
Unofficial Comments:This prime has 1 user comment below.
Proof-code(s): (*):p339 : Zhou, LLR, OpenPFGW
Decimal Digits:455677   (log10 is 455676.35885715)
Rank (*):6291 (digit rank is 1)
Entrance Rank (*):280
Currently on list? (*):no
Submitted:1/26/2012 17:16:10 CDT
Last modified:10/25/2013 08:51:18 CDT
Removed (*):9/8/2020 10:32:58 CDT
Database id:104057
Status Flags:Verify
Score (*):44.2199 (normalized score 0.8261)

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.

Lei Zhou writes (11 Sep 2014):  (report abuse)
This prime is proven using id=82770 prime as helper.

It can be written as 67930*((33305**2^756839)^2-1)-1,
which is canonicalized to the listed form.
The helper was proven prime using LLR on 2007-10-28 09:52:12.
Then the current prime is proven using OpenPFGW with id=82770 as helper.

Certificate shown below:
./pfgw -tc -l"33965.proof" -h"helper" -q"2*33965*(33305*33305*2^1513678-1)-1"
Primality testing 2*33965*(33305*33305*2^1513678-1)-1 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Primality testing 2*33965*(33305*33305*2^1513678-1)-1 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Primality testing 2*33965*(33305*33305*2^1513678-1)-1 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 2
Primality testing 2*33965*(33305*33305*2^1513678-1)-1 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 2 Running N+1 test using discriminant 11, base 1+sqrt(11)
Running N+1 test using discriminant 11, base 3+sqrt(11) Calling N+1 BLS with factored part 50.00% and helper 0.00% (150.01% proof)
2*33965*(33305*33305*2^1513678-1)-1 is prime!
(145794.4785s+0.0615s)

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_id104057
person_id9
machineRedHat P4 P4
whattrial_divided
notesCommand: /home/caldwell/client/TrialDiv/TrialDiv -q 37674760044125 2 1513679 -67931 2>&1 [Elapsed time: 10.614 seconds]
modified2020-07-07 17:30:29
created2012-01-26 17:18:01
id137703

fieldvalue
prime_id104057
person_id9
machineRedHat P4 P4
whatprime
notesPFGW Version 3.3.4.20100405.x86_Stable [GWNUM 25.14] Primality testing 67930*((33305*2^756839)^2-1)-1 [N+1, Brillhart-Lehmer-Selfridge] Reading factors from helper file helper: 33305*2^756839+1 Running N-1 test using base 2 Running N+1 test using discriminant 11, base 1+sqrt(11) Primality testing 67930*((33305*2^756839)^2-1)-1 [N+1, Brillhart-Lehmer-Selfridge] Running N+1 test using discriminant 3, base 1+sqrt(3) Calling Brillhart-Lehmer-Selfridge with factored part 50.00% 67930*((33305*2^756839)^2-1)-1 is prime! (48200.9321s+0.0589s)
modified2020-07-07 17:30:29
created2012-01-26 17:23:01
id137704

Query times: 0.0005 seconds to select prime, 0.0007 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.