Proof-code: x30

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

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

Descriptive Data: (report abuse)
This code celebrates the fact that more than 30% of the digits of 10^15600-1 are factorized. Pari-GP was used to implement a Konyagin-Pomerance method for proving these palindromes prime. OpenPFGW performed the BLS tests, which were necessary but far from sufficient.
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
Display (short):Broadhurst & Dubner
Database id:95 (do not use this database id, it is subject to change)
Proof program:unknown
Entry last modified:2024-05-20 02:37:17
Printed from the PrimePages <t5k.org> © Reginald McLean.