Proof-code: L1167

Previous Next Random

Samuel Yates began, and this site continues, a database of the largest known primes. Primes in that database are assigned a proof-code to show who should be credited with the discovery as well as what programs and projects they used. (Discoverers have one prover-entry, but may have many proof-codes because they use a variety of programs...)

This page provides data on L1167, one of those codes.

Code name (*):L1167   (See the descriptive data below.)
Persons (*):1 (counting humans only)
Projects (*):1 (counting projects only)
Display (HTML):Chambers, PSieve, Srsieve, PrimeGrid, LLR
Number of primes:total 44
Unverified Primes:0 (prime table entries marked 'Composite','Untested', or 'InProcess'
Score for Primes (*):total 46.3685

Descriptive Data: (report abuse)
Fermat Number divisibility was checked using the following settings in OpenPFGW: -gxo -a1 prime OpenPFGW's bio page at the Prime Pages can be found HERE. Also, for more information about Fermat and Generalized Fermat Number divisors, please see Wilfrid Keller's sites: * Prime factors k.2^n + 1 of Fermat numbers Fm and complete factoring status * Factors of generalized Fermat numbers found after Björn & Riesel
I am a member of this code and I would like to:
Edit the descriptive data above as:

Below is additional information about this entry.

Display (text):Chambers, PSieve, Srsieve, PrimeGrid, LLR
Display (short):Chambers
Database id:4502 (do not use this database id, it is subject to change)
Proof program:LLR  
Entry last modified:2022-01-27 19:50:10
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.