Question

A) What sequence (At least 8 sequences) of pseudorandom numbers is generated using the linear congruential generator xn+1 (3xn2) mod 13 with seed Xo- 1? B)Find the sequence of pseudorandom numbers generated by the power generator with p-7, d-3, and seed xo 2

Answer 1

Consider the equation X_n+1 =(3X_n+2) mod 13 given X₀₌₁

_So X₁ =(3X0+2) mod 13=(3*1 +2) mod 13=5 mod 13 = 5

  X2 =(3X₁+2) mod 13=(3*5 +2) mod 13=17 mod 13=4

  X₃= (3X2+2) mod 13=(3*4 +2) mod 13=14 mod 13=1

  X4= (3X₃+2) mod 13=(3*1 +2) mod 13=5 mod 13=5

X₅= (3X₄+2) mod 13=(3*5 +2) mod 13=17 mod 13=4

  X6= (3X5+2) mod 13=(3*4 +2) mod 13=14 mod 13=1

X7= (3X6+2) mod 13=(3*1 +2) mod 13=5mod 13=5

X₈= (3X₇+2) mod 13=(3*5 +2) mod 13=17mod 13=4

The series of number generator is 5,4,1,5,4,1,5,4

2.