Linear congruential algorithm
Category : Bold Essays Writing
Linear congruential algorithm
If we take the linear congruential algorithm with an additive component of 0, Xn+1 = (aXn) mod m
Then it can be shown that if m is prime and if a given value of produces the maximum period of m – 1 , then akwill also produce the maximum period, provided that is less than m and that and m – 1 are relatively prime. Demonstrate this by using X0= 1and m = 31and producing the sequences for ak= 3 3233and34
您必须登录才能发表评论。