## The LCG method is very fast but it suffers from sequential correlations.

## If

*k*random numbers at a time are used to plot points in*k*-dimensional space, points tend to lie on (*k*-1)-dimensional hyperplanes. There will be__at most__*m*1/*k*planes, e.g. ~1600 if*k*=3 &*m*=232!## The quality of a LCG is measured by the maximum distance between successive hyperplanes: the smaller the distance, the better.