Proof-code: p363

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

Code name (*):p363   (See the descriptive data below.)
Persons (*):1 (counting humans only)
Projects (*):0 (counting projects only)
Display (HTML):Batalov, OpenPFGW
Number of primes:total 13
Unverified Primes:0 (prime table entries marked 'Composite','Untested', or 'InProcess'
Score for Primes (*):total 46.8289, on current list 46.7036 (normalized score 10)
Entrance Rank (*):mean 7853.00 (minimum 85, maximum 16886)

Descriptive Data: (report abuse)
This code is primarily used for the potential divisors of double Mersenne numbers (2Mp-1). PFGW is used to prove primality (with the respective Mersenne prime as a helper prime). The candidates are sieved with a custom program, and then tested for primality and finally for double Mersenne number divisibility.

See also: http://mersenneforum.org/forumdisplay.php?f=99 and http://www.doublemersennes.org/
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, OpenPFGW
Display (short):Batalov
Database id:7313 (do not use this database id, it is subject to change)
Proof program:PrimeForm  The primes from this code accounts for 1.720% of the (active) primes and 1.040% of the (active) score for this program.
Entry last modified:2021-10-16 19:37:43
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.