# 58882 · 5^{265981} - 1

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: | 58882 · 5^{265981} - 1 |
---|---|

Verification status (*): | Proven |

Official Comment (*): | [none] |

Proof-code(s): (*): | p225 : Benson1, Srsieve, SierpinskiRiesel, PRP, OpenPFGW |

Decimal Digits: | 185918 (log_{10} is 185917.51070585) |

Rank (*): | 31247 (digit rank is 1) |

Entrance Rank (*): | 871 |

Currently on list? (*): | no |

Submitted: | 6/12/2008 10:41:04 CDT |

Last modified: | 6/12/2008 21:39:35 CDT |

Removed (*): | 2/5/2011 15:58:32 CDT |

Database id: | 85143 |

Status Flags: | none |

Score (*): | 41.4636 (normalized score 0.0507) |

#### 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 85143 person_id 9 machine RedHat P4 P4 what trial_divided notes Command: /home/caldwell/client/TrialDiv/TrialDiv -q 58882 5 265981 -1 2>&1 [Elapsed time: 9.755 seconds] modified 2020-07-07 17:30:39 created 2008-06-12 10:52:01 id 99426

field value prime_id 85143 person_id 9 machine RedHat P4 P4 what prime notes Command: /home/caldwell/client/pfgw -tp -q"58882*5^265981-1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 58882*5^265981-1 [N+1, Brillhart-Lehmer-Selfridge] Running N+1 test using discriminant 7, base 6+sqrt(7) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(81920,20) to FFT(81920,19) Reduced from FFT(81920,19) to FFT(81920,18) Reduced from FFT(81920,18) to FFT(81920,17) Reduced from FFT(81920,17) to FFT(81920,16) 1235226 bit request FFT size=(81920,16) Running N+1 test using discriminant 7, base 7+sqrt(7) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(81920,20) to FFT(81920,19) Reduced from FFT(81920,19) to FFT(81920,18) Reduced from FFT(81920,18) to FFT(81920,17) Reduced from FFT(81920,17) to FFT(81920,16) 1235226 bit request FFT size=(81920,16) Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 58882*5^265981-1 is prime! (38793.8576s+0.0414s) [Elapsed time: 10.78 hours] modified 2020-07-07 17:30:39 created 2008-06-12 10:53:01 id 99427

Query times: 0.0002 seconds to select prime, 0.0002 seconds to seek comments.

Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.