1963! - 1
|Description:||1963! - 1|
|Verification status (*):||Proven|
|Official Comment (*):||Factorial|
|Unofficial Comments:||This prime has 1 user comment below.|
|Proof-code(s): (*):||CD : Dubner, Caldwell, Cruncher|
|Decimal Digits:||5614 (log10 is 5613.5280486594)|
|Rank (*):||84173 (digit rank is 2)|
|Entrance Rank (*):||115|
|Currently on list? (*):||short|
|Score (*):||30.6487 (normalized score 0)|
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.
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.
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.
field value prime_id 23398 person_id 9 machine Windows XP P4 1.8GHz what prime notes Primality testing 1963!-1 [N+1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 33.38% 1963!-1 is prime! (85.016000 seconds) PFGW Version 20021217.Win_Dev (Beta 'caveat utilitor') [FFT v22.7 w/P4] Running N+1 test using discriminant 1973, base 1+sqrt(1973) Running N+1 test using discriminant 1973, base 2+sqrt(1973) modified 2003-03-25 11:23:48 created 2002-12-27 15:06:53 id 53353
Query times: 0.0004 seconds to select prime, 0.0007 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.