Proof-code: p229

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

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

Descriptive Data: (report abuse)
This code is for submitting primes that cannot be reduced to k*2^n+/-1 (k<2^n) form but still do not need any helper files to be proven by OpenPFGW.
NewPGen are used to sieve a range, then a PRP check is applied for potential candidate. PRPs are fed to OpenPFGW for final proving.
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, PRP, OpenPFGW
Display (short):Zhou
Database id:3609 (do not use this database id, it is subject to change)
Proof program:PrimeForm  
Entry last modified:2024-07-13 06:37:21
Printed from the PrimePages <> © Reginald McLean.