The Setting
Take a nonconstant polynomial irreducible over and an integer exponent , say with . The question is how often the values for integers are divisible by no prime -th power , and how that asymptotic density follows once the polynomial is normalized and large-prime contributions are controlled. The sieve transfer reduces this global count to local congruence counts modulo and large-prime tail estimates.
Definitions
For a nonnegative integer , an integer is -power-free if no prime -th power divides (so is excluded and negative integers are allowed).✦ Given a polynomial , a nonnegative integer , and a real number , the counting function is the nonnegative integer (1): (1)✦
For a polynomial and a nonnegative integer , the root count is the nonnegative integer (2), which gives the number of roots of modulo when : (2)✦ A polynomial is locally admissible for a nonnegative integer if holds for every prime .✦
At a prime , the local factor for and is the real number .✦ The asymptotic density constant of a polynomial and a nonnegative integer is the real number defined by the infinite product (3) of the local factors over all primes : (3)✦
The asymptotic density statement holds for a polynomial and a nonnegative integer when the infinite product (3) converges, , and as in .✦
Define ✦ and ✦.
The Claim
Theorem 1. Let and let be an integer.
Suppose is irreducible over with , , is locally admissible for , and for a nonzero integer and with over ; then satisfies the asymptotic density statement (4): (4)✦
Under the same irreducibility, degree, exponent, and local admissibility assumptions on and , a vanishing tail ratio over implies that satisfies the asymptotic density statement (5): (5)✦
For an irreducible polynomial over , there exist and satisfying (6): (6)✦
A vanishing dyadic tail limit over yields (7): (7)✦
When is irreducible over with , , and is locally admissible for , the asymptotic density constant satisfies (8): (8)✦
In the paper, the result reads: if is irreducible over of degree , an integer satisfies for every prime , with , the positive content of , and primitive with positive leading coefficient, and , then with . In contrast, (4) through (8) separate out the normalization (6), the dyadic-to-global tail step (7), and the Euler product (8), while relaxing to and to (), taking the tail limits along integers via and , and taking the density asymptotic over real with explicit convergence of the product.
What Is Checked
The claims (4) through (8) are stated over integer polynomials and nonnegative integer exponents (with irreducibility over in (4), (5), (6), and (8); , , and local admissibility in (4), (5), and (8); and a nonzero integer satisfying in (4)), using -power-free integers, the counting function , the root count , the local factors , the asymptotic density constant , the asymptotic density statement, and the tail counts and with their vanishing limit hypotheses.