238090 + 47269

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:238090 + 47269
Verification status (*):PRP
Official Comment (*):ECPP
Proof-code(s): (*):c51 : Luhn, Broadhurst, NewPGen, OpenPFGW, Primo
Decimal Digits:11467   (log10 is 11466.232534841)
Rank (*):81589 (digit rank is 2)
Entrance Rank (*):45080
Currently on list? (*):no
Submitted:5/23/2010 18:45:38 UTC
Last modified:3/11/2023 15:54:10 UTC
Database id:92821
Status Flags:Verify
Score (*):32.8641 (normalized score 0)

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.
Elliptic Curve Primality Proof (archivable *)
Prime on list: no, rank 253
Subcategory: "ECPP"
(archival tag id 210693, tag last modified 2024-03-24 06:37:14)

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_id92821
person_id9
machineRedHat P4 P4
whattrial_divided
notesCommand: /home/caldwell/client/TrialDiv/TrialDiv -q 1 2 38090 47269 2>&1 [Elapsed time: 8.130 seconds]
modified2020-07-07 22:30:34
created2010-05-23 18:48:01
id115022

fieldvalue
prime_id92821
person_id9
machineRedHat P4 P4
whatprp
notesCommand: /home/caldwell/client/pfgw -tc -q"2^38090+47269" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 2^38090+47269 [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 2 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(5120,21) to FFT(5120,20) Reduced from FFT(5120,20) to FFT(5120,19) Reduced from FFT(5120,19) to FFT(5120,18) Reduced from FFT(5120,18) to FFT(5120,17) Reduced from FFT(5120,17) to FFT(5120,16) 76190 bit request FFT size=(5120,16) Running N+1 test using discriminant 5, base 5+sqrt(5) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(5120,21) to FFT(5120,20) Reduced from FFT(5120,20) to FFT(5120,19) Reduced from FFT(5120,19) to FFT(5120,18) Reduced from FFT(5120,18) to FFT(5120,17) Reduced from FFT(5120,17) to FFT(5120,16) 76198 bit request FFT size=(5120,16) Calling N+1 BLS with factored part 0.05% and helper 0.04% (0.20% proof) 2^38090+47269 is Fermat and Lucas PRP! (49.3700s+0.0000s) [Elapsed time: 49.00 seconds]
modified2020-07-07 22:30:34
created2010-05-23 18:53:02
id115023

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