Proof-code: x39

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

Code name (*):x39   (See the descriptive data below.)
Persons (*):3 (counting humans only)
Projects (*):0 (counting projects only)
Display (HTML):Broadhurst, Dubner, Keller, OpenPFGW, Primo
Number of primes:total 1
Unverified Primes:0 (prime table entries marked 'Composite','Untested', or 'InProcess'
Score for Primes (*):total 35.6869, on current list 35.6869
Entrance Rank (*):mean 29752.00 (minimum 29752, maximum 29752)

Descriptive Data: (report abuse)
The following methodology was used: (1) Pari-GP for cyclotomic and Aurifeuillian factorizations of N-1; (2) GMP-ECM for extracting probably prime factors of such cofactors; (3) OpenPFGW, Primo and APR-CL for proving that these helpers are indeed prime; (4) OpenPFGW for BLS tests with these prime helpers; (5) parallelized Pari-GP code for the final Coppersmith--Howgrave-Graham proof.
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):Broadhurst, Dubner, Keller, OpenPFGW, Primo
Display (short):Broadhurst, Dubner & Keller
Database id:4075 (do not use this database id, it is subject to change)
Proof program:unknown
Entry last modified:2024-05-22 11:37:09
Printed from the PrimePages <> © Reginald McLean.