(648257 - 1)2 - 2

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:(648257 - 1)2 - 2
Verification status (*):Proven
Official Comment (*):[none]
Proof-code(s): (*):p13 : Ballinger, OpenPFGW
Decimal Digits:75103   (log10 is 75102.489779527)
Rank (*):47979 (digit rank is 1)
Entrance Rank (*):882
Currently on list? (*):no
Submitted:4/5/2004 23:52:06 CDT
Last modified:4/5/2004 23:52:06 CDT
Removed (*):10/23/2006 03:15:55 CDT
Database id:69758
Status Flags:none
Score (*):38.6718 (normalized score 0.0038)

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_id69758
person_id9
machineLinux P4 2.8GHz
whatprime
notesCommand: /home/caldwell/client/pfgw -f -tc -q"(6^48257-1)^2-2" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing (6^48257-1)^2-2 [N-1/N+1, Brillhart-Lehmer-Selfridge] trial factoring to 25101062 Running N-1 test using base 5 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(32768,20) to FFT(32768,19) Reduced from FFT(32768,19) to FFT(32768,18) Reduced from FFT(32768,18) to FFT(32768,17) Reduced from FFT(32768,17) to FFT(32768,16) 498980 bit request FFT size=(32768,16) Running N+1 test using discriminant 11, base 3+sqrt(11) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(32768,20) to FFT(32768,19) Reduced from FFT(32768,19) to FFT(32768,18) Reduced from FFT(32768,18) to FFT(32768,17) Reduced from FFT(32768,17) to FFT(32768,16) 498988 bit request FFT size=(32768,16) Running N+1 test using discriminant 11, base 4+sqrt(11) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(32768,20) to FFT(32768,19) Reduced from FFT(32768,19) to FFT(32768,18) Reduced from FFT(32768,18) to FFT(32768,17) Reduced from FFT(32768,17) to FFT(32768,16) 498988 bit request FFT size=(32768,16) Calling N+1 BLS with factored part 50.02% and helper 0.00% (150.07% proof) (6^48257-1)^2-2 is prime! (13242.3312s+0.0103s)
modified2020-07-07 17:30:45
created2004-04-05 23:53:01
id74711

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