andom numbers are used in {simulation} and

encryption. They are pseudorandom not random because the sequence eventually repeats exactly and is entirely determined by the initial conditions.

One of the simplest algorithms is

	x[i+1] = (a * x[i] + c) mod m

but this repeats after at most m numbers and successive numbers are closely related. Better algorithms generally use more previous numbers to calculate the next number.

Last updated: 2007-06-29

Nearby terms:

andom numbers are used in {simulation} andix} networking device which appears

Try this search on Wikipedia, OneLook, Google