Let be a finite nonnegative sequence, let be a set of prime numbers, and define
The sifting function is
For a finite set of integers, take to be the number of occurrences of in ; then counts members divisible by no below . For , write
Suppose the sieve distribution has the form
where is a multiplicative arithmetic function on squarefree integers and . Define
Then the Selberg upper-bound sieve states
for , with immaterial endpoint changes under other level conventions.
To construct the weights, put
and set
Then . If , the divisor sum equals one, and hence
Summing against and expanding gives
The Selberg diagonalization of the positive quadratic form gives
Finally, grouping the error by gives at most pairs for each squarefree ; using yields the stated remainder.
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.