Proof-code: x26

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

Code name (*):x26   (See the descriptive data below.)
Persons (*):2 (counting humans only)
Projects (*):0 (counting projects only)
Display (HTML):Augustin, Jobling, NewPGen
Number of primes:total 2
Unverified Primes:0 (prime table entries marked 'Composite','Untested', or 'InProcess'
Score for Primes (*):total 33.7279

Descriptive Data: (report abuse)
Proofs were based on Proth's theorem and completed using a program written in C with Harvey Dubner's 'Scrunch' library.
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):Augustin, Jobling, NewPGen
Display (short):Augustin & Jobling
Database id:272 (do not use this database id, it is subject to change)
Proof program:unknown
Entry last modified:2021-12-02 12:37:16
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.