Bryant Tuckerman

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):	T
E-mail address:	(e-mail address unknown)
Username	Tuckerman	(entry created on 1/18/2000 18:50:53 UTC)
Database id:	37	(entry last modified on 3/28/2006 17:16:17 UTC)
Active primes:	This entry has no primes on the current list.
Total primes:	number ever on any list: 1 (unweighted total: 1)
Production score:	no primes, so no score for current list, total 30.8563

Descriptive Data: (report abuse)

Bryant Tuckerman died on May 19, 2002, at the age of 86.

Dr. Tuckerman obtained a Ph.D. in topology from Princeton University. He taught mathematics at Cornell University and Oberlin College. Then he worked for five years at the Institute for Advanced Study with John von Neumann on applications of early computers. He spent the remaining 35 years of his professional career at the IBM T. J. Watson Research Center in the Mathematics Department, where he received many awards for his pioneering work on applications of computers for scientific calculations, number theory, cryptography and data security. In 1971 he published what was then the largest known prime number, the "24th Mersenne prime" 2¹⁹⁹³⁷-1. He was a key member of the IBM team that developed the "Data Encryption Standard" DES, which was officially adopted by the U.S. government in 1976. In 1983, 1988 and 2002, he was a coauthor (with Brillhart, Lehmer, Selfridge and Wagstaff) of a book on factorizations of numbers bⁿ+1. (by S. S. Wagstaff, 31 May 2002)

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

I am Bryant Tuckerman 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.