Derrick Henry "Dick" Lehmer (February 23, 1905 – May 22, 1991), almost always cited as D.H. Lehmer, was an American mathematician significant to the development...

The Lehmer random number generator (named after D. H. Lehmer), sometimes also referred to as the Park–Miller random number generator (after Stephen K. Park...

after Derrick Henry Lehmer Lehmer random number generator, named after D. H. Lehmer Lehmer sieve Lucas–Lehmer test Lucas–Lehmer–Riesel test, in mathematics...

particular φ(n) divides n − 1. D. H. Lehmer conjectured in 1932 that there are no composite numbers with this property. Lehmer showed that if any composite...

In mathematics and in particular in combinatorics, the Lehmer code is a particular way to encode each possible permutation of a sequence of n numbers....

amount of time. The term "backtrack" was coined by American mathematician D. H. Lehmer in the 1950s. The pioneer string-processing language SNOBOL (1962) may...

(2001) [1994], "Zeta-function", Encyclopedia of Mathematics, EMS Press Lehmer, D. H. (1956), "Extended computation of the Riemann zeta-function", Mathematika...

(Washington, D.C.: U.S. Government Printing Office, 1951): pp. 36–38. Lehmer, Derrick H. (1951). "Mathematical methods in large-scale computing units". Proceedings...

intervals has been identified with the hyperbolic numbers by M. Warmus and D. H. Lehmer through the identification z = 1 2 ( x + y ) + 1 2 ( x − y ) j , {\displaystyle...

the words "let X1,...,Xn be independent random variables...". Yet as D. H. Lehmer stated in 1951: "A random sequence is a vague notion... in which each...

sequence corresponds to any non-negative number N was first observed by D. H. Lehmer. Indeed, a greedy algorithm finds the k-combination corresponding to...

computed without factoring n. If p is prime, then φ(p) = p − 1. In 1932 D. H. Lehmer asked if there are any composite numbers n such that φ(n) divides n −...

In mathematics, the Lucas–Lehmer test (LLT) is a primality test for Mersenne numbers. The test was originally developed by Édouard Lucas in 1878 and subsequently...

Proceedings of the London Mathematical Society Vol. 15 (1916), p. xxii (with D. H. Lehmer) 'On Factoring Large Numbers', Bulletin of the American Mathematical...

n, not depending on special form or properties. It was described by D. H. Lehmer and R. E. Powers in 1931, and developed as a computer algorithm by Michael...

Swinnerton-Dyer 1973 Due to Kolberg 1962 Due to Ashworth 1968 Due to Lahivi Due to D. H. Lehmer Due to Ramanujan 1916 Due to Wilton 1930 Due to J.-P. Serre 1968, Section...

Internet Archive. D. H. Lehmer (1976). "Strong Carmichael numbers". J. Austral. Math. Soc. 21 (4): 508–510. doi:10.1017/s1446788700019364. Lehmer proved that...

proven by D. H. Lehmer and J. M. H. Olmstead. In his 1933 paper, Lehmer proved the theorem for cosine by proving a more general result. Namely, Lehmer showed...

at the University of California, Los Angeles, under the direction of D. H. Lehmer, with a computer search program written and run by Prof. R. M. Robinson...

theorists first organized by D. H. and Emma Lehmer at the Asilomar Conference Grounds in 1969. In his tribute to D. H. Lehmer, John Brillhart stated that...

obtaining a bachelor's degree in 1893 and a master's in 1896. Lehmer was awarded his Ph.D. from the University of Chicago in 1900 for a thesis, Asymptotic...

Lehmer's conjecture, also known as the Lehmer's Mahler measure problem, is a problem in number theory raised by Derrick Henry Lehmer. The conjecture asserts...

called "approximate numbers", the second of which forms a real algebra. D. H. Lehmer reviewed the article in Mathematical Reviews and observed that this second...

"Fermat factoring status". Retrieved 11 April 2017. John Brillhart; D. H. Lehmer; J. L. Selfridge (April 1975). "New Primality Criteria and Factorizations...

Lehmer sieves are mechanical devices that implement sieves in number theory. Lehmer sieves are named for Derrick Norman Lehmer and his son Derrick Henry...

number. The first five candidate numbers are often called the Lehmer five (named after D.H. Lehmer): 276, 552, 564, 660, and 966. However, it is worth noting...

Audit, and Security Technology (COAST) Laboratory. with John Brillhart, D. H. Lehmer, John L. Selfridge, Bryant Tuckerman: Factorization of bn ± 1, b = 2...

a Lehmer pair is a pair of zeros of the Riemann zeta function that are unusually close to each other. They are named after Derrick Henry Lehmer, who...

future husband Derrick H. Lehmer. Upon her graduation summa cum laude with a B.A. in Mathematics (1928), Emma married the younger Lehmer. They moved to Brown...

Glaisher (1883). "A theorem in partitions". Messenger of Math. 12: 158–170. D. H. Lehmer (1946). "Two nonexistence theorems on partitions". Bull. Amer. Math....