At this site we maintain a list of the 5000 Largest Known Primes which is updated hourly. This list is the most important databases at The Prime Pages: 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:

field (help) value Description: U(8353)/(176465477 · 2184683363573 · 3620673479519515599362549) Verification status (*): PRP Official Comment: Fibonacci cofactor Proof-code(s): (*): c8 : Water, Broadhurst, Primo Decimal Digits: 1701   (log10 is 1700.17943639) Rank (*): 65088 (digit rank is 3) Entrance Rank (*): 44501 Currently on list? (*): short Submitted: 3/7/2004 05:40:44 CDT Last modified: 3/7/2004 05:40:44 CDT Database id: 69381 Status Flags: Verify Score (*): 26.9305 (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.

Fibonacci cofactor (archivable *)

Prime on list: yes, rank 20
Subcategory: "Fibonacci cofactor"
(archival tag id 179925, tag last modified 2005-12-04 20:20:24)

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.

field value prime_id 69381 person_id 9 machine Linux P4 2.8GHz what prp notes Command: /home/caldwell/client/pfgw -f -tc -q"U(8353)/(176465477*2184683363573*3620673479519515599362549)" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing U(8353)/(176465477*2184683363573*3620673479...5599362549) [N-1/N+1, Brillhart-Lehmer-Selfridge] trial factoring to 418417 Running N-1 test using base 2 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(768,22) to FFT(768,21) Reduced from FFT(768,21) to FFT(768,20) Reduced from FFT(768,20) to FFT(768,19) Reduced from FFT(768,19) to FFT(768,18) Reduced from FFT(768,18) to FFT(768,17) Reduced from FFT(768,17) to FFT(768,16) 11304 bit request FFT size=(768,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(768,22) to FFT(768,21) Reduced from FFT(768,21) to FFT(768,20) Reduced from FFT(768,20) to FFT(768,19) Reduced from FFT(768,19) to FFT(768,18) Reduced from FFT(768,18) to FFT(768,17) Reduced from FFT(768,17) to FFT(768,16) 11312 bit request FFT size=(768,16) Running N+1 test using discriminant 5, base 6+sqrt(5) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(768,22) to FFT(768,21) Reduced from FFT(768,21) to FFT(768,20) Reduced from FFT(768,20) to FFT(768,19) Reduced from FFT(768,19) to FFT(768,18) Reduced from FFT(768,18) to FFT(768,17) Reduced from FFT(768,17) to FFT(768,16) 11312 bit request FFT size=(768,16) Running N+1 test using discriminant 5, base 9+sqrt(5) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(768,22) to FFT(768,21) Reduced from FFT(768,21) to FFT(768,20) Reduced from FFT(768,20) to FFT(768,19) Reduced from FFT(768,19) to FFT(768,18) Reduced from FFT(768,18) to FFT(768,17) Reduced from FFT(768,17) to FFT(768,16) 11312 bit request FFT size=(768,16) Calling N+1 BLS with factored part 0.69% and helper 0.16% (2.25% proof) U(8353)/(176465477*2184683363573*3620673479...5599362549) is Fermat and Lucas PRP! (7.5596s+0.0006s) modified 2004-04-13 09:53:22 created 2004-03-07 05:53:58 id 74349