Proof-code: L1035

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

Code name (*): L1035 (See the descriptive data below.)

Persons (*): 1 (counting humans only)

Projects (*): 1 (counting projects only)

Display (HTML): Pletsch, Srsieve, PrimeGrid, LLR

Number of primes: total 3

Unverified Primes: 0 (prime table entries marked 'Composite','Untested', or 'InProcess'

Score for Primes (*): total 42.4788

Descriptive Data: (report abuse)

Fermat Number divisibility was checked using the following settings in OpenPFGW:

-gxo -a1 prime

OpenPFGW's bio page at the Prime Pages can be found HERE. Also, for more information about Fermat and Generalized Fermat Number divisors, please see Wilfrid Keller's sites:

I am a member of this code and I would like to:

Below is additional information about this entry.

Display (text): Pletsch, Srsieve, PrimeGrid, LLR

Display (short): Pletsch

Database id: 4348 (do not use this database id, it is subject to change)

Proof program: LLR

Entry last modified: 2024-11-23 23:37:08

Code name (*):	L1035 (See the descriptive data below.)
Persons (*):	1 (counting humans only)
Projects (*):	1 (counting projects only)
Display (HTML):	Pletsch, Srsieve, PrimeGrid, LLR
Number of primes:	total 3
Unverified Primes:	0 (prime table entries marked 'Composite','Untested', or 'InProcess'
Score for Primes (*):	total 42.4788

Display (text):	Pletsch, Srsieve, PrimeGrid, LLR
Display (short):	Pletsch
Database id:	4348 (do not use this database id, it is subject to change)
Proof program:	LLR
Entry last modified:	2024-11-23 23:37:08