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 p162, one of those codes.
Code name (* ):p162 (See the descriptive data below.) Persons (* ):3 (counting humans only) Projects (* ):0 (counting projects only) Display (HTML) :AndersonM , Grobstich , Broadhurst , OpenPFGW Number of primes :total 1 Unverified Primes :0 (prime table entries marked 'Composite','Untested', or 'InProcess') Score for Primes (* ):total 40.3443, on current list 40.3443 (normalized score 1) Entrance Rank (* ):mean 350.00 (minimum 350, maximum 350)
I am a member of this code and I would like to:
Descriptive Data:
(report abuse )
By combining primes on Chris Caldwell's list, David
Broadhurst used PFGW to find a third prime that forms an
arithmetic progression with smaller primes found by Peter
Grobstich and Mark Anderson. All three are credited, since
the largest prime would be of little interest without the
other two. It is pleasant to record that the two seeds came
from Wilfrid Keller's accurate compilation
of primes of the form k*2^n-1 with odd k < 300. David
thanks Chris and Wilfrid for their high standards of record
keeping and collegiality.
Below is additional information about this entry.
Display (text): AndersonM, Grobstich, Broadhurst, OpenPFGW Display (short): AndersonM, Grobstich & Broadhurst Database id: 953 (do not use this database id, it is subject to change) Proof program: PrimeForm The primes from this code accounts for 0.126% of the (active) primes and 0.027% of the (active) score for this program.Entry last modified: 2009-11-22 05:50:12
