Proof-code: x28

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

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

Descriptive Data: (report abuse)
Proving primality using a test for numbers of the form A23n+1, n odd, described in a paper published by me and Pedro Berrizbeitia in the Proceedings of the American Mathematical Society 130 (2002), 363-365.

I have several computers in the mathematics department running a program written in C testing these numbers.

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):Iskra
Display (short):Iskra
Database id:146 (do not use this database id, it is subject to change)
Proof program:unknown
Entry last modified:2022-05-26 18:50:23
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.