You are here: irt.org | FOLDOC | pseudorandom number
<programming> One of a sequence of numbers generated by some
algorithm so as to have an even distribution over some range
of values and minimal correlation between successive
Pseudorandom 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.
Nearby terms: pseudo « pseudocode « pseudoprime « pseudorandom number » PseudoScheme » pseudosuit » pseudo-tty
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL
©2018 Martin Webb