We consider the periods of the linear congruential and the power generators modulo and, for fixed choices of initial parameters, give lower bounds that hold for ``most’’ when ranges over three different sets: the set of primes, the set of products of two primes (of similar size), and the set of all integers. For most in these sets, the period is at least for any monotone function tending to zero as tends to infinity. Assuming the Generalized Riemann Hypothesis, for most in these sets the period is greater than for any $\epsilon
0n^{1/2+\delta}$, for some fixed , for a positive proportion of in the above mentioned sets. These bounds are related to lower bounds on the multiplicative order of an integer modulo , modulo , and modulo where range over the primes, ranges over the integers, and where is the order of the largest cyclic subgroup of .

生成讲解博客的中文版本

生成AI智能校验的中文版本