To be removed soon:   language help

Proof-code: x43

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

Code name (*):x43   (See the descriptive data below.)
Persons (*):4 (counting humans only)
Projects (*):0 (counting projects only)
Display (HTML):Leyland, Underwood, Water, Broadhurst
Number of primes:total 5
Unverified Primes:0 (prime table entries marked 'Composite','Untested', or 'InProcess')
Score for Primes (*):total 38.2646

Descriptive Data: (report abuse)
Here we celebrate our amazing feat, otherwise unrecognized in the database, of proving the primality of 2^64695-32769 by a Konyagin-Pomerance method, after massive GMP-ECM effort. The KP proof of this remarkable helper was implemented in Pari-GP. Then OpenPFGW proved the trivial consequences which are recorded by this code.
I am a member of this code and I would like to:Here we celebrate our amazing feat, otherwise unrecognized in the database, of proving the primality of 2^64695-32769 by a Konyagin-Pomerance method, after massive GMP-ECM effort. The KP proof of this remarkable helper was implemented in Pari-GP. Then OpenPFGW proved the trivial consequences which are recorded by this code.
Edit descriptive data (below) as:

Below is additional information about this entry.

Display (text):Leyland, Underwood, Water, Broadhurst
Display (short):Leyland, Underwood, Water & Broadhurst
Database id:370 (do not use this database id, it is subject to change)
Proof program:unknown
Entry last modified:2020-07-04 16:20:10
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.