Question 23.7: Using the multiplicative congruential method discussed earli......

Using the multiplicative congruential method discussed earlier in the chapter, generate three six-digit random numbers starting with an initial random number of 2,143,856,907, a value for A of 37,182,496, and a value for B of 97,365,129.

Step-by-Step
The 'Blue Check Mark' means that this solution was answered by an expert.
Learn more on how do we answer questions.

The recursion relationship employed by the multiplicative congruential method is N_i = (A · N_{i−1} + B) mod M, where N_{i−1} is a positive integer, A and B are positive integers, and the modulus M is a large positive integer. In this case, A = 37,182,496, B = 97,365,129, and N_{i−1} = 2,143,856,907. Any six sequential digits of N_1 will be the first random number, any six sequential digits of N_2 will be the second random number, and any six sequential digits of N_3 will be the third random number

Related Answered Questions