Proof-code: x40

Previous Next Random

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

Code name (*): x40 (See the descriptive data below.)

Persons (*): 2 (counting humans only)

Projects (*): 0 (counting projects only)

Display (HTML): Bedwell, Broadhurst, OpenPFGW

Number of primes: total 1

Unverified Primes: 0 (prime table entries marked 'Composite','Untested', or 'InProcess'

Score for Primes (*): total 40.3048

Descriptive Data: (report abuse)

David Broadhurst's Konyagin-Pomerance programme was used, after OpenPFGW had done the N-1 BLS tests. GMP-ECM yielded partial factorizations of N-1 and N+1 that were insufficient for a Williams-Lenstra proof.

I am a member of this code and I would like to:

Below is additional information about this entry.

Display (text): Bedwell, Broadhurst, OpenPFGW

Display (short): Bedwell & Broadhurst

Database id: 4255 (do not use this database id, it is subject to change)

Proof program: unknown

Entry last modified: 2024-11-21 16:37:09

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

Display (text):	Bedwell, Broadhurst, OpenPFGW
Display (short):	Bedwell & Broadhurst
Database id:	4255 (do not use this database id, it is subject to change)
Proof program:	unknown
Entry last modified:	2024-11-21 16:37:09