Proof-code: L4506

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

Code name (*):L4506   (See the descriptive data below.)
Persons (*):2 (counting humans only)
Projects (*):1 (counting projects only)
Display (HTML):Propper, Batalov, CycloSv, EMsieve, PIES, Prime95, LLR
Number of primes:total 16
Unverified Primes:0 (prime table entries marked 'Composite','Untested', or 'InProcess'
Score for Primes (*):total 51.8134, on current list 51.8134 (normalized score 1698)
Entrance Rank (*):mean 176.69 (minimum 12, maximum 1478)

Descriptive Data: (report abuse)
P.I.E.S. is the decade-old project to search for primes of the form Φm(b) where m is a 3-smooth number.

Yves Gallot's Cyclo program (both CPU and GPU implementations) can be used for m = 3 * 2n. Prime95 with the option PhiExtensions=1 (or LLR with modifications) can be used for m = 3v * 2n, where v<=2; for v=1, this is 1.5x slower than CycloCPU but the range of values of b is 1.5x wider.
In addition, Prime95 can be run in multi-threaded mode, so the double-check can be an order of magnitude faster than the intitial 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):Propper, Batalov, CycloSv, EMsieve, PIES, Prime95, LLR
Display (short):Propper & Batalov
Database id:8354 (do not use this database id, it is subject to change)
Proof program:LLR  The primes from this code accounts for 0.325% of the (active) primes and 2.120% of the (active) score for this program.
Entry last modified:2021-05-14 22:37:20
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.