Honorary Fellow Derrick Henry Lehmer
Derrick Henry Lehmer. The wide scope of Professor Lehmer's research in Combinatorics, Number Theory, Computational Techniques, and the interconnections that exist among these areas can best be grasped by looking at the three volumes of his "Selected Papers" that appeared in 1981. Much of modern combinatorics is heavily dependent on on the computer, and Professor Lehmer, fallowing in a family tradition, has been a godfather to the development of computer algorithms, generating computational results, and getting other researchers to recognize the importance of computation.
From his citation as one of the first Honorary Fellows, BICA (1), 1991.
From his well-cited wikipedia page:
Derrick Henry "Dick" Lehmer (February 23, 1905 – May 22, 1991) was an American mathematician who refined Édouard Lucas' work in the 1930s and devised the Lucas–Lehmer test for Mersenne primes. Lehmer's 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.
From his citation as one of the first Honorary Fellows, BICA (1), 1991.
From his well-cited wikipedia page:
Derrick Henry "Dick" Lehmer (February 23, 1905 – May 22, 1991) was an American mathematician who refined Édouard Lucas' work in the 1930s and devised the Lucas–Lehmer test for Mersenne primes. Lehmer's 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.
Comments
Post a Comment