If we take the linear congruential algorithm with an additive component of 0, Then it can be

Question:

If we take the linear congruential algorithm with an additive component of 0,image text in transcribed

Then it can be shown that if m is prime and if a given value of produces the maximum period of m - 1, then ak will also produce the maximum period, provided that k is less than m and that and m - 1 are relatively prime. Demonstrate this by using X0 = 1 and m = 31 and producing the sequences for ak = 3 32, 33, and 34.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: