Proof-code: x37

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

Code name (*):x37   (See the descriptive data below.)
Persons (*):1 (counting humans only)
Projects (*):0 (counting projects only)
Display (HTML):Zhou, LLR
Number of primes:total 15
Unverified Primes:0 (prime table entries marked 'Composite','Untested', or 'InProcess'
Score for Primes (*):total 44.2670

Descriptive Data: (report abuse)
LLR cannot prove these primes, without modification. The author found a way of modifiying LLR so as to preserve its speed and extend its range.
The primes under this code are still type of k*2^n+/-1 with k<2^n, satisfying the requirement of llr and proth test, with a giant k.
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, LLR
Display (short):Zhou
Database id:3511 (do not use this database id, it is subject to change)
Proof program:unknown
Entry last modified:2021-07-24 00:37:17
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.