Conjectures 'R Us

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):

E-mail address:

gbarnes017

(at)

gmail

(dot)

com

Web page:

http://www.mersenneforum.org/forumdisplay.php?f=81

Username:

CRUS

(entry created on 01/15/08)

Database id:

1372

(entry last modified on 10/07/21)

Active primes:

on current list: 495.5, rank by number 2

Total primes:

number ever on any list: 902

Production score:

for current list 52 (normalized: 3056), total 52.5257, rank by score 5

Largest prime:

6962 · 31^2863120 - 1 ‏(‎4269952 digits) via code L5410 on 02/29/20

Most recent:

1334 · 567²²³³⁴⁴ - 1 ‏(‎615000 digits) via code L5410 on 10/27/21

Entrance Rank:

mean 1406.91 (minimum 20, maximum 4608)

Unprocessed:

prime submissions still untested or inprocess: 1.

Descriptive Data: (report abuse)

Our project aims to prove many of the Riesel and Sierpinski conjectures for bases 2 thru 1030 that are not currently being worked on by other projects or efforts.

Definition:
For every base (b) for the forms k*b^n+1 and k*b^n-1, there exists a k-value for each form that is conjectured to be the lowest 'Sierpinski value' (+1 form) or 'Riesel value' (-1) that is composite for all values of n >= 1.

k's that have a trivial factor (one factor the same) for all n-values as well as k's that make Generalized Fermat #'s are not considered.

We also have a BOINC effort named SRBase that helps greatly in working on the project. Details can be found at: https://srbase.my-firewall.org/sr5/

Surname: CRUS (used for alphabetizing and in codes)
Unverified primes are omitted from counts and lists until verification completed.

I administer Conjectures 'R Us and I would like to