Search results

  1. GS question - pseudo random number generator

    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...
Back
Top