The Setting
Take a polynomial and a nonnegative integer . As ranges over the positive integers, the question is how often avoids -th powers of primes and how congruence obstructions across primes modulo determine an asymptotic density.
The Definition
Definition 1. Given a nonnegative integer , an integer is -power-free if no prime -th power divides : (1)✦
The local congruence count of a polynomial modulo a nonnegative integer is the number of residue classes with : (2)✦
For a polynomial , a nonnegative integer , and a real number , the counting function is the number of positive integers at which is -power-free in the sense of (1): (3)✦
A polynomial is locally admissible for a nonnegative integer if its local congruence counts (2) satisfy at every prime : (4)✦
At each prime , the local Euler factor of a polynomial and a nonnegative integer is the real number giving the fraction of residue classes with , defined from (2) by (5)✦
Associated to a polynomial and a nonnegative integer , the asymptotic density constant is the real number given by the infinite product of the local Euler factors (5) over all primes : (6)✦
For a polynomial and a nonnegative integer , the asymptotic density statement is the assertion that the Euler product (6) of the local factors (5) converges unconditionally, , and the counting function (3) obeys as : (7)✦
What Is Checked
The definitions (1), (2), (3), (4), (5), (6), and (7) are stated over polynomials , integers , nonnegative integers , primes , and real numbers .