Some things are broken, we are working on it. Do not submit anything yet.

John Cosgrave

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):	g132, g245
E-mail address:	John.Cosgrave@spd.dcu.ie
Web page:	http://www.spd.dcu.ie/johnbcos/
Username:	Cosgrave	(entry created on 01/18/00)
Database id:	184	(entry last modified on 03/28/06)
Active primes:	on current list: 3 (unweighted total: 3), rank by number 288
Total primes:	number ever on any list: 6 (unweighted total: 6)
Production score:	for current list 46 (normalized: 7), total 46.2622, rank by score 512
Largest prime:	3 · 2^2478785 + 1 ‏(‎746190 digits) via code g245 on 10/14/03
Most recent:	3 · 2^2478785 + 1 ‏(‎746190 digits) via code g245 on 10/14/03
Entrance Rank:	mean 6.33 (minimum 5, maximum 7)

Descriptive Data: (report abuse)

I am the head of the Mathematics department in St. Patrick's College, Drumcondra, Dublin 9, IRELAND. I use a Pentium (1700MHz). My interests are Mathematics (of course!), my family and friends, books (all sorts ... literature, biography, music, history, ...), music (especially Indian classical music (I have over 400 L.P. or CD recordings - my favourites are the sitarist Nikhil Banerjee and the sarodist Ali Akbar Khan). In July 1999 - using Yves Gallot's Proth program - I found a new largest composite Fermat number F(382447) (details at my web site), and in February/March 2003 - using Paul Jobling's newpgen, George Woltman's PRP, and Yves Gallot's Proth - I found a new larger one: F(2145353)

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

I am John Cosgrave 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.)