Lehmer RNG
Okay, so imagine you have a big bag of candy, but you don't want to just randomly pick a piece of candy from the bag each time. Instead, you want to come up with a way to choose a candy that doesn't repeat too often and seems like a good mix of candy types.
That's basically what the Lehmer Random Number Generator (RNG) does. It's a special computer program that generates random numbers in a way that tries to avoid repeating the same number too often and has a good mix of numbers.
The Lehmer RNG works by using a mathematical formula that takes an input number (called the "seed") and produces a new number based on that seed. This new number becomes the next seed, which is used to generate the next number, and so on.
The formula used by the Lehmer RNG is based on something called modular arithmetic, which is a way of doing math where you only consider the remainder when you divide by a certain number (like when you count hours on a clock, for example).
The Lehmer RNG is named after its creator, Derrick Henry Lehmer, who was a mathematician and computer scientist. It was one of the first RNGs used in computer programs and is still used today in some cases. It's considered to be a "good" RNG because it generates numbers that seem random and is relatively fast to use.
That's basically what the Lehmer Random Number Generator (RNG) does. It's a special computer program that generates random numbers in a way that tries to avoid repeating the same number too often and has a good mix of numbers.
The Lehmer RNG works by using a mathematical formula that takes an input number (called the "seed") and produces a new number based on that seed. This new number becomes the next seed, which is used to generate the next number, and so on.
The formula used by the Lehmer RNG is based on something called modular arithmetic, which is a way of doing math where you only consider the remainder when you divide by a certain number (like when you count hours on a clock, for example).
The Lehmer RNG is named after its creator, Derrick Henry Lehmer, who was a mathematician and computer scientist. It was one of the first RNGs used in computer programs and is still used today in some cases. It's considered to be a "good" RNG because it generates numbers that seem random and is relatively fast to use.