Linked from

The 12 pages that link to Pseudorandom number generator, each with the reason it gives.

• Modular arithmeticRelated: Linear congruential generators produce each value using a recurrence modulo a fixed integer.

• AlgorithmCompared with: It can make an algorithm appear randomized while remaining deterministic from its seed.

• RandomnessBroader topic: It creates useful random-looking sequences from an initial seed.

• Procedural generationRelated: Seeds let a game reproduce generated content while varying it across runs.

• Random number generationCompared with: It can generate random-looking sequences quickly, but its output is determined by its initial state.

• Marin MersenneNarrower topic: The Mersenne–Twister is a widely used example of this computational tool.

• Deterministic algorithmCompared with: Its output repeats from the same seed, despite its random-looking behavior.

• Random number generatorBroader topic: Most software games and simulations use this algorithmic form.

• Integer sequenceRelated: Some generators produce integer-valued sequences for simulation and computation.

• Frequency-hopping spread spectrumRelated: Its output can define a repeatable hopping pattern shared by radios.

• Chaos and nonlinear dynamicsCompared with: Both can produce irregular sequences, but their mechanisms and purposes differ.

• Rogers–Ramanujan continued fractionRelated: Finite-field analogues of the fraction have been studied in constructions of pseudorandom sequences.