Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Lehmer random number generator

Numerical Algorithm

The Lehmer random number generator, named after D. H. Lehmer and sometimes called the Park-Miller random number generator after Stephen K. Park and Keith W. Miller, is a type of linear congruential generator that works in the multiplicative group of integers modulo n. Each value is the previous value multiplied by a constant and reduced modulo m, where m is a prime or a power of a prime, the multiplier has high multiplicative order modulo m, and the seed is coprime to m. It is also known as the multiplicative linear congruential generator and the multiplicative congruential generator.

Connections

Credited To

Source Lehmer random number generator (Wikipedia)

In Field

Source Lehmer random number generator (Wikipedia)

Invented

Source Lehmer random number generator (Wikipedia)
Sources
Lehmer random number generator (Wikipedia)
  • In Group: Statistical and Randomness Testing, Lead
    is a type of linear congruential generator (LCG) that operates in multiplicative group of integers modulo n.
  • In Field: Algorithms and Complexity Theory, Lead [in-field]
    The Lehmer random number generator (named after D. H. Lehmer)
  • Credited To: Derrick Henry Lehmer, Lead
    The Lehmer random number generator (named after D. H. Lehmer)
  • Invented: Derrick Henry Lehmer, Lead
    The Lehmer random number generator (named after D. H. Lehmer)
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.