Hans Riesel (1929–2014)


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): BR
E-mail address: (e-mail address unpublished)
Username Riesel (entry created on 1/18/2000 12:50:53 CDT)
Database id:116 (entry last modified on 10/5/2015 10:49:18 CDT)
Active primes:This entry has no primes on the current list.
Total primes: number ever on any list: 0.5 (unweighted total: 1)
Production score: no primes, so no score for current list, total 28.7119

Descriptive Data: (report abuse)

Obituary: http://www.mersenneforum.org/showpost.php?p=411994&postcount=470

[From his web page:] I was born in Stockholm in 1929. I have studied mathematics and numerical analysis at the University of Stockholm. My career with computers started back in 1953 with Sweden's first electronic computer, the BESK (Binary Electronic Sequence Calculator), a variant of the so-called Princeton machine. From 1960 to 1963 I served as head of the math department of the Swedish Board for Computing Machinery, an organization which was swallowed up by SAFAD, the Swedish Agency for Administrative Development. I served the SAFAD until 1969, when I was appointed lecturer in numerical analysis at the Royal Institute of Technology in Stockholm. My scientific work has mainly been performed in Computational Mathematics. I have published one major book, "Prime Numbers and Computer Methods for Factorization", Birkhäuser, Boston 1985, 2nd ed. 1994.

Error in data above: HTML_Tidy reports: line 22 column 14 - Warning: inserting implicit <p> line 7 column 1 - Warning: trimming empty <p> line 22 column 14 - Warning: trimming empty <p>

Surname: Riesel (used for alphabetizing and in codes)
Unverified primes are omitted from counts and lists until verification completed.
I am Hans Riesel (1929–2014) and I would like to
Edit this page

Submit primes using the proof-code: (a password will be required)

(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.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.