 Random number generation

Random number generation produces values intended to follow a prescribed probability distribution. A physical source uses a measured uncertain process; a pseudorandom number generator deterministically expands a seed into a reproducible sequence. For a uniform integer on $\{0,\dots ,m-1\}$, reducing a uniform $b$-bit integer modulo $m$ is biased unless $m$ divides $2^b$. Rejection sampling fixes this by accepting only values below $m\lfloor 2^b/m\rfloor$ before taking the remainder. For $b=3,m=3$, accept $0,\dots ,5$: each residue then has exactly two preimages.

Random number generation is the process of producing numbers that cannot be predicted statistically. It is essential in various fields such as cryptography, computer simulations, statistical sampling, and gaming, where randomness is required to ensure fairness, create varied outputs, or simulate random phenomena. There are two main approaches to random number generation: 1. **True Random Number Generators (TRNGs)**: These generate numbers based on physical phenomena that are inherently random, such as thermal noise, radioactive decay, or atmospheric noise.