Proof-code: L466

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

Code name (*):L466   (See the descriptive data below.)
Persons (*):1 (counting humans only)
Projects (*):0 (counting projects only)
Display (HTML):Zhou, NewPGen, LLR
Number of primes:total 185
Unverified Primes:0 (prime table entries marked 'Composite','Untested', or 'InProcess'
Score for Primes (*):total 49.4210, on current list 49.2951 (normalized score 110)
Entrance Rank (*):mean 935.80 (minimum 29, maximum 2758)

Descriptive Data: (report abuse)
This code is mainly used on finding n fixed k*2^n+/1 type of primes with n either a Mersenne exponent, or a Fibonacci number. Also, a few k fixed series are being tested. NewPGen is the main means of sieving for this code.
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):Zhou, NewPGen, LLR
Display (short):Zhou
Database id:3385 (do not use this database id, it is subject to change)
Proof program:LLR  The primes from this code accounts for 0.203% of the (active) primes and 0.124% of the (active) score for this program.
Entry last modified:2022-06-24 20:37:12
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.