Proof-code: x22

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

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

Persons (*): 2 (counting humans only)

Projects (*): 0 (counting projects only)

Display (HTML): Underbakke, Carmody

Number of primes: total 995

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

Score for Primes (*): total 42.6440

Descriptive Data: (report abuse)

The program is pure Proth's Theorem: two expmods, one GCD, and nothing more. Implemented in circa 20 lines of GMP, and only ever run on Phil's aging Alpha!

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

Below is additional information about this entry.

Display (text): Underbakke, Carmody

Display (short): Underbakke & Carmody

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

Proof program: unknown

Entry last modified: 2024-04-26 16:37:16

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

Display (text):	Underbakke, Carmody
Display (short):	Underbakke & Carmody
Database id:	243 (do not use this database id, it is subject to change)
Proof program:	unknown
Entry last modified:	2024-04-26 16:37:16