加载中…
Assuming a uniform -variant of the prime -tuple conjecture, we compute moments of the number of primes in arithmetic progressions to a large modulus as the residue classes vary. Consequently, depending on the size of , the prime count follows either a Gaussian or a Poisson distribution. In particular, the least prime in progressions follows an exponential distribution, with some unexpected discrepancies observed for smooth moduli.

生成讲解博客的中文版本

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