To be removed soon:   language help

Proof-code: x35

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

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

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: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!
Edit descriptive data (below) as:

Below is additional information about this entry.

Display (text):Underbakke, Narayanan, Carmody, PRP
Display (short):Underbakke, Narayanan & Carmody
Database id:458 (do not use this database id, it is subject to change)
Proof program:unknown
Entry last modified:2020-11-27 08:50:12
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.