Shuffling integers

Lehmer's Method for shuffling is the simplest, and is completely analysable.

1.

Multiply the current value, x_j, by magic1, a constant.

2.

Reduce the result modulo magic2, another constant, and post in x_j+1.

In FORTRAN this might look like:

      x(j) = MOD(x(j - 1)*magic1,magic2)

This scheme leads to a complete, shuffled set of the integers from 1 through (magic2-1) if certain constraints on magic1 and magic2 are met.