s******n
发帖数: 34 | 1 what is the maximum period obtainable from the following generator?
Xn+1=(aXn) mod m, m=16
what should be the value of a?
what restrictions are required on the seed?
anyone can help? thanks. | w********u
发帖数: 71 | 2 For Xn+1 = (aXn) mode m, if m is a power of 2, the cycle can be
at most m/4, if you choose a = 3+8k or 5+8k, and the seed is odd.
what is the maximum period obtainable from the following generator?
Xn+1=(aXn) mod m, m=16
what should be the value of a?
what restrictions are required on the seed?
anyone can help? thanks.
【在 s******n 的大作中提到】
: what is the maximum period obtainable from the following generator?
: Xn+1=(aXn) mod m, m=16
: what should be the value of a?
: what restrictions are required on the seed?
: anyone can help? thanks.
| s******n
发帖数: 34 | 3 this is a theorem? which one?
Thank you very much.
【在 w********u 的大作中提到】
: For Xn+1 = (aXn) mode m, if m is a power of 2, the cycle can be
: at most m/4, if you choose a = 3+8k or 5+8k, and the seed is odd.
:
: what is the maximum period obtainable from the following generator?
: Xn+1=(aXn) mod m, m=16
: what should be the value of a?
: what restrictions are required on the seed?
: anyone can help? thanks.
| w********u
发帖数: 71 | 4 You can check any textbook with "random-number generation".
Or just google "linear-congruential generator".
This is originally proposed by D.H.Lehmer in 1949.
this is a theorem? which one?
Thank you very much.
【在 s******n 的大作中提到】
: this is a theorem? which one?
: Thank you very much.
|
|
