Proof-code: g427

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

Code name (*):g427   (See the descriptive data below.)
Persons (*):1 (counting humans only)
Projects (*):0 (counting projects only)
Display (HTML):Batalov, Srsieve, LLR, Proth.exe
Number of primes:total 8
Unverified Primes:0 (prime table entries marked 'Composite','Untested', or 'InProcess'
Score for Primes (*):total 47.8107, on current list 47.7392 (normalized score 17)
Entrance Rank (*):mean 189.25 (minimum 83, maximum 308)

Descriptive Data: (report abuse)
This code is used for testing certain Proth primes, and determining order of 2 modulo these primes.
Following tradition, Proth.exe was initially used for the latter, but this was later refactored with a much faster solution based on minor changes to the code of LLR v.3.8.d. Order of 2 modulo primes where base is composite is only possible with this code (Proth.exe accepts k*q^n+1 only with prime q for the order test).
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):Batalov, Srsieve, LLR, Proth.exe
Display (short):Batalov
Database id:7700 (do not use this database id, it is subject to change)
Proof program:Proth.exe  The primes from this code accounts for 6.667% of the (active) primes and 2.357% of the (active) score for this program.
Entry last modified:2024-02-29 05:37:30
Printed from the PrimePages <> © Reginald McLean.