Question: A well-known method of generating a sequence of pseudo-random integers x0, x1. . . . . . . in the interval from 0 to n

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.

Step by Step Solution

3.48 Rating (171 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a The sequence is 3 7 0 7 7 4 1 5 6 1 7 8 5 3 8 1 9 0 9 9 ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

952-M-L-A-E (2924).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!