Proof-code: L690

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 L690, one of those codes.

Code name (*):L690   (See the descriptive data below.)
Persons (*):1 (counting humans only)
Projects (*):1 (counting projects only)
Display (HTML):Cholt, Srsieve, PrimeGrid, LLR
Number of primes:total 28
Unverified Primes:0 (prime table entries marked 'Composite','Untested', or 'InProcess'
Score for Primes (*):total 49.8176, on current list 49.8161 (normalized score 109)
Entrance Rank (*):mean 61.25 (minimum 56, maximum 70)

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:

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):Cholt, Srsieve, PrimeGrid, LLR
Display (short):Cholt
Database id:3747 (do not use this database id, it is subject to change)
Proof program:LLR  The primes from this code accounts for 0.085% of the (active) primes and 0.110% of the (active) score for this program.
Entry last modified:2024-11-21 19:37:09
Printed from the PrimePages <t5k.org> © Reginald McLean.