a) Consider the multiplicative congruential generator with (a = 13, m = 64, c = 0, and

seeds X0 = 1, 2, 3, 4).

(i) Does this generator achieve its maximum period for these parameters?

(ii) Generate one period’s worth of uniform random variables from each of the supplied

seeds

asked by guest
on Dec 26, 2024 at 12:40 pm



Mathbot Says...

I wasn't able to parse your question, but the HE.NET team is hard at work making me smarter.