Question

Consider the linear congruential algorithm with an additive component of 0, i.e., Xn+1 =(aXn) mod m...

Consider the linear congruential algorithm with an additive component of 0, i.e., Xn+1 =(aXn) mod m

a. It can be shown that if m is prime and if a given value of a produces the maximum period of m-1, then akwill also produce the maximum period, provided that k is less than m and that k 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.

Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider m=24, i.e., Xn+1 =(aXn) mod 24. (Hint: This is a common case for a linear...
Consider m=24, i.e., Xn+1 =(aXn) mod 24. (Hint: This is a common case for a linear congruential algorithm when m is a power of 2.) What should be the value of a to achieve the maximum period?
Consider m=24, i.e., Xn+1 =(aXn) mod 24. (Hint: This is a common case for a linear...
Consider m=24, i.e., Xn+1 =(aXn) mod 24. (Hint: This is a common case for a linear congruential algorithm when m is a power of 2.) What restrictions are required on the seed?
Consider the above quadratic residue generator xn+1 = xn2 mod m with m = 4783 ×...
Consider the above quadratic residue generator xn+1 = xn2 mod m with m = 4783 × 4027. Write a program to generate pseudo-random numbers from this generator. Use this to determine the period of the generator starting with seed x0 = 196, and with seed x0 = 400?
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT