SOLVED: We are setting up pseudorandom number generator in our computer using a "linear congruential" number generator, which produces integer numbers via the following recursive algorithm: Xn l (aXn c) mod m (1)(a) We pick values for the parameters a, C, and m. Starting from seed Xo, we use the above algorithm to produce sequence of the first m numbers Xi We notice that X3 and X45 have the same value Is it a problem? Why? And, if you think it is a problem, can we fix it by changing Xo?(b Why

Write a code to test a uniform pseudorandom number generator. If you do not have a canned generator available, write a generator based on L’Ecuyer’s recommended generator in Appendix I. Apply the following tests: average hxi = 1/2, variance x 2 ? hxi 2 = 1/12, and the pair correlations test xi kxi = 1/4 for k 6= 0. Generate a histogram of pairs of numbers on a two-dimensional unit square and test that the distribution is statistically uniform. | Numerade

SOLVED:What sequence of pseudorandom numbers is generated using the linear congruential generator xn 1= (4 xn 1) mod 7 with seed x0=3 ?