I was aksed this question when having an interview with GS, could not figure out the solution.
Given a generator:
X_{n+1} = ( a * X_{n} + c ) mod m
where Xn is the sequence of pseudorandom values, and
m: 0 < m — the "modulus"
a: 0 < a < m — the "multiplier"
c: 0 <= c < m — the...
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.