Proof-code: L591
(Another of the Prime Pages' resources)
The Largest Known Primes Icon
  View this page in:   language help
  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 L591, one of those codes.

Code name (*):L591   (See the descriptive data below.)
Persons (*):1 (counting humans only)
Projects (*):1 (counting projects only)
Display (HTML):Penne, Srsieve, CRUS, LLR
Number of primes:total 5
Unverified Primes:0 (prime table entries marked 'Composite','Untested', or 'InProcess')
Score for Primes (*):total 47.4384, on current list 47.4311 (normalized score 40)
Entrance Rank (*):mean 100.50 (minimum 90, maximum 111)

I am a member of this code and I would like to:
Submit primes using this code as: (A password will be required before submission is completed.)
Edit descriptive data (below) as:

Descriptive Data: (report abuse)
The last remaining k=23451 beeing eliminated by finding a prime, then I can assert : k=66741 is the least odd value of k for which all Proth numbers k*2^n+1 with even n are composite. That is to say this Liskovets-Gallot conjecture is now proven!
Below is additional information about this entry.
Display (text):Penne, Srsieve, CRUS, LLR
Display (short):Penne
Database id:3570 (do not use this database id, it is subject to change)
Proof program:LLR  The primes from this code accounts for 0.042% of the (active) primes and 0.068% of the (active) score for this program.
Entry last modified:2017-10-20 23:50:13