Let
and let be the product of the finitely many primes at most or dividing some nonzero difference . Sieve with the primes . For such a prime, the congruence has exactly distinct roots. By the Chinese remainder theorem, the root-counting function is multiplicative on squarefree coprime to , and
Thus the polynomial root density in a sieve applies with
Take and . For squarefree coprime to ,
The supplied mean-value estimate, partial summation, and removal of square factors using give
The error in the Selberg upper-bound sieve is
Consequently
If every is prime and all of them exceed , then has no prime divisor with , apart from a fixed finite set of divisibility cases absorbed into the implied constant. The cases with some contribute . Therefore

Articles by others on the same topic (0)

There are currently no matching articles.