Geoffrey Reynolds' srsieve

program

A titan, as defined by Samuel Yates, is anyone who has found a titanic prime. This page provides data on those that have found these primes. The data below only reflects on the primes currently on the list. (Many of the terms that are used here are explained on another page.)

Proof-code(s):
L190, p196, p201, p202, p203 ... ... L6048, A32, L6050, L6051, L6052
E-mail address:
g_w_reynolds(at)yahoo(dot)co(dot)nz
Web page:http://sites.google.com/site/geoffreywalterreynolds/programs/
Username Srsieve (entry created on 7/4/2006 23:03:41 UTC)
Database id:905 (entry last modified on 7/18/2024 12:52:11 UTC)
Program Does *: sieve
Active primes:on current list: 3192, rank by number 2
Total primes: number ever on any list: 31689
Production score: for current list 55 (normalized: 39370), total 55.7351, rank by score 3
Largest prime: 10223 · 231172165 + 1 ‏(‎9383761 digits) via code SB12 on 11/6/2016 18:15:13 UTC
Most recent: 5103 · 21982741 + 1 ‏(‎596869 digits) via code L5885 on 7/24/2024 22:43:11 UTC
Entrance Rank: mean 1019.16 (minimum 7, maximum 56919)

Descriptive Data: (report abuse)

A 'fixed k' sieve for multiple integer sequences in n of the form k*b^n+c, where k < 2^64, |c| < 2^63, b < 2^32.

Srsieve was originally developed to speed up sieving for the Sierpinski/Riesel base 5 projects, which seek primes of the form k*5^n+/-1 for certain even values of k.

Some specialised versions of the program are faster in certain cases:

sr1sieve: A single sequence k*b^n+/-1 with k < 2^64, b < 2^32.

sr2sieve: Multiple sequences k*b^n+/-1 or b^n+/-k with k < 2^32, b < 2^32.

sr5sieve: Multiple base 5 sequences k*5^n+/-1 with k < 2^32.

Surname: Srsieve (used for alphabetizing and in codes).
Note that the prime search page will not display more than 16,000 primes.
Unverified primes are omitted from counts and lists until verification completed.
I administer Geoffrey Reynolds' srsieve and I would like to
Edit this page
Printed from the PrimePages <t5k.org> © Reginald McLean.