A well-known method of generating a sequence of "pseudo-random" integers x0, x1. . . . . . . in the interval from 0 to n is based on the Fibonacci equation u(k+2) = u(k+1) + u(k) mod n. with initial values u(0), u(l) chosen from the integers 0,1, 2,........., n - 1.
(a) Generate the sequence of pseudo-random numbers that result from the choices n = 10. u(0) = 3, u(l) = 7. Keep iterating until the sequence starts repeating.
(b) Experiment with other sequences of pseudorandom numbers generated by the method.