Proof-code: p449

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

Code name (*):p449   (See the descriptive data below.)
Persons (*):1 (counting humans only)
Projects (*):0 (counting projects only)
Display (HTML):Rodriguez2, OpenPFGW
Number of primes:total 1
Unverified Primes:0 (prime table entries marked 'Composite','Untested', or 'InProcess'
Score for Primes (*):total 46.9255, on current list 46.9255 (normalized score 6)
Entrance Rank (*):mean 975.00 (minimum 975, maximum 975)

Descriptive Data: (report abuse)
The prime follows the format n = p * q + 1
To prove the primality using pfgw, you need to create a helper file named helper.txt containing p (either as the expression or the actual number), which is the large factor of n−1.
The prime p has already been proven to be prime (in this case, I'm using a Mersenne prime).
Then, use the following command:
pfgw64 -t -hhelper.txt -q"primetoprove"
Then, pfgw will do a Pocklington's test with the large factor.
This method follows the Pocklington theorem, adapted for finding primes
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):Rodriguez2, OpenPFGW
Display (short):Rodriguez2
Database id:10307 (do not use this database id, it is subject to change)
Proof program:PrimeForm  The primes from this code accounts for 0.242% of the (active) primes and 0.310% of the (active) score for this program.
Entry last modified:2024-11-21 12:37:15
Printed from the PrimePages <t5k.org> © Reginald McLean.