Condition for a congruential generator to have a full period It can be shown that the congruential generator given in Eq (1)has a full period i e. m, if and only if )c and m have no common divisor (i. e, no common divisor other an 2)a=l mod(g) for every prime factor of m 3)a=l mod(4) if m is multiplier of 4 It is obvious that m should be as large as possible! m=231-1 is often used on a computer with 32 bitsCondition for a congruential generator to have a full period: It can be shown that the congruential generator given in Eq.(1) has a full period, i.e. m, if and only if 1) c and m have no common divisor (i.e., no common divisor other than 1); 2) a1 mod(g) for every prime factor of m; 3) a1 mod(4) if m is multiplier of 4. It is obvious that m should be as large as possible! m=231 -1 is often used on a computer with 32 bits