D. H. Lehmer | |
|---|---|
.jpg) Lehmer in 1984 | |
| Born | Derrick Henry Lehmer February 23, 1905 Berkeley, California, U.S. |
| Died | May 22, 1991 (aged 86) Berkeley, California, U.S. |
| Nationality | American |
| Education | University of California, Berkeley Brown University |
| Known for | Lehmer's polynomial Lehmer matrix Lehmer sieve Lehmer–Schur algorithm Lehmer's GCD algorithm Lehmer code Lehmer's conjecture Lehmer number Lehmer five Lucas–Lehmer test Lehmer mean Meissel–Lehmer algorithm Lehmer pair Pocklington–Lehmer test Lehmer random number generator Lehmer sequence Lehmer's totient problem Continued fraction factorization |
| Scientific career | |
| Fields | Mathematics |
| Institutions | UC Berkeley |
| Doctoral advisor | Jacob Tamarkin |
| Doctoral students | Tom Apostol John Brillhart Ronald Graham David Singmaster Harold Stark Peter J. Weinberger |
Derrick Henry "Dick" Lehmer (February 23, 1905 – May 22, 1991), almost always cited as D.H. Lehmer,[1][2][3] was an American mathematician significant to the development of computational number theory. Lehmer refined Édouard Lucas' work in the 1930s and devised the Lucas–Lehmer test for Mersenne primes. His peripatetic career as a number theorist, with him and his wife taking numerous types of work in the United States and abroad to support themselves during the Great Depression, fortuitously brought him into the center of research into early electronic computing.
- ^ e.g., Selected papers of D.H. Lehmer (2 vols.), 1981, ISBN 0919611001
- ^ Photo signed D.H. Lehmer
- ^ Google ngrams comparison of D. H. Lehmer and other variants combined: Derrick Henry Lehmer, Derrick H. Lehmer, Derrick Lehmer [1]