Question: Given the modulus m and the two seeds x0, x1, with 0 < x0,x1 < m, a sequence of pseudorandom numbers can be generated recursively

Given the modulus m and the two seeds x0, x1, with 0 < x0,x1 < m, a sequence of pseudorandom numbers can be generated recursively from xn = (xn-1 + xn-2) mod m, n > 2. This generator is called the Fibonacci generator.
Find the first ten pseudorandom numbers generated when m = 37 and x0 = 1, x1 = 28.

Step by Step Solution

3.45 Rating (165 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

x 0 1 x 1 28 x 2 x 1 x 0 mod 37 28 1 mod ... 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

954-M-L-A-L-S (8416).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!