In: Statistics and Probability
m = 16, and c=0.
SOLUTION:
From given data,
Consider a linear congruential random number generator with parameters a = 3,m = 16, and c=0.
a = 3,
m = 16,
c=0.
The recurrence relation to define generator is
Xn+1 = (a Xn+c) mod m
here X is sequence of random numbers
and X0 is referred to seed which is also called start value.
Select the seed X0 = 3, and generate 3 random variables using this generator.
No we have X0 = 3, we need to generate three random numbers with it
as we are starting with n = 0 (X0)
X1 = (a*X0 + c ) mod m
X1 = (3*3 + 0) mod 16
X1 = 9 mod 16
X1 = 9
Now let us try X2
X2 = (a * X1 + 0) mod 16
X2 = (3*9 + 0) mod 16
X2 = 27 mod 16
X2 = 11
Now X3
X3 = (a * X2 + 0) mod 16
X3 = (3* 11 + 0) mod 16
X3 = 33 mod 16
X3 = 1
What is the period of this generator
Period of Generator :
When c = 0 then generator is call multiplicative congruential generator and period of MCG is at most m