3229# + 1
|Description:||3229# + 1|
|Verification status (*):||Proven|
|Official Comment (*):||Primorial|
|Proof-code(s): (*):||D : Dubner, Cruncher|
|Decimal Digits:||1368 (log10 is 1367.83852245409)|
|Rank (*):||105350 (digit rank is 3)|
|Entrance Rank (*):||129|
|Currently on list? (*):||short|
|Score (*):||26.2513 (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.
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 40847 person_id 9 machine Linux PII 200 what prime notes PFGW Version 20020311.x86_Dev (Alpha software, 'caveat utilitor') Running N-1 test using base 2 Primality testing 3229#+1 [N-1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 33.55% 3229#+1 is prime! (15.960000 seconds) modified 2003-03-25 11:23:45 created 2002-12-27 16:23:10 id 54365
Query times: 0.0002 seconds to select prime, 0.0002 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.