To be removed soon:   language help

Proof-code: x13

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

Code name (*):x13   (See the descriptive data below.)
Persons (*):1 (counting humans only)
Projects (*):0 (counting projects only)
Display (HTML):Renze
Number of primes:total 1
Unverified Primes:0 (prime table entries marked 'Composite','Untested', or 'InProcess')
Score for Primes (*):total 31.6852, on current list 31.6852
Entrance Rank (*):mean 31068.00 (minimum 31068, maximum 31068)

Descriptive Data: (report abuse)
Coppersmith--Howgrave-Graham method for searching for divisors in residue classes. This method has been discussed in the primeform mailing list.
I am a member of this code and I would like to:Coppersmith--Howgrave-Graham method for searching for divisors in residue classes. This method has been discussed in the primeform mailing list.
Edit descriptive data (below) as:

Below is additional information about this entry.

Display (text):Renze
Display (short):Renze
Database id:1029 (do not use this database id, it is subject to change)
Proof program:unknown
Entry last modified:2020-08-06 17:20:15
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.