Note 2023 is the last year that I will maintain this site--there is currently no plan to continue it after that.

Gordon Spence

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

User supplied image--mail editor to report abuse.

Proof-code(s):

E-mail address:

gordon

(at)

rugeley

(dot)

demon

(dot)

Username

Spence

(entry created on 1/18/2000 12:50:53 CDT)

Database id:

(entry last modified on 5/11/2021 12:09:04 CDT)

Active primes:

on current list: 1 (unweighted total: 1), rank by number 541

Total primes:

number ever on any list: 1 (unweighted total: 1)

Production score:

for current list 46 (normalized: 5), rank by score 645

Largest prime:

2^2976221 - 1 ‏(‎895932 digits) via code G2 on 8/24/1997

Most recent:

2^2976221 - 1 ‏(‎895932 digits) via code G2 on 8/24/1997

Entrance Rank:

mean 1.00 (minimum 1, maximum 1)

Descriptive Data: (report abuse)

When Gordon Spence found the Mersenne prime M2976221 he was 38 years old, married to Lynn, and had two daughters Rachel (14) and Danielle (12). He lives in Hampshire UK and work as an IT Manager for Thorn Microwave Devices Ltd. His interests include: "drag racing, playing quake, my family (not in that order!!) and of course, searching for big prime numbers." Gordon has always had an interest in mathematical recreations, and wrote a fractal program 16 years ago for a 16KB Z80 based machine, the Sinclair ZX81.

Error in data above: HTML_Tidy reports: line 9 column 62 - Info: value for attribute "href" missing quote marks

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

I am Gordon Spence and I would like to

(Reuse an old code if your are using the same programs, projects... Only create a new code if you are doing something differently than in the past. Duplicate codes will be merged.