The Setting
Take a polynomial of degree that is irreducible over , and set . For a quartic (, ), the question is how often avoids every prime square as runs over positive integers up to ; in general, how often is divisible by no prime -th power ? When no prime -th power divides every value of on , does this count grow linearly in with a positive Euler product as leading factor?
Definitions
Given an integer , an integer is -power-free if for every prime , so is excluded while negative integers are allowed.✦
The counting function of a polynomial , an integer , and a real number is the number of integers for which is -power-free: (1)✦
For a polynomial and a nonnegative integer , the modular root count is the number of residue classes with : (2)✦
At each prime , the local factor of a polynomial and an integer is the real number .✦
The asymptotic density constant of a polynomial and an integer is the Euler product of the local factors over all primes : (3)✦
A polynomial is locally admissible for an integer if for every prime .✦
A polynomial and an exponent satisfy the asymptotic density statement if the infinite product of the local factors over all primes converges, the asymptotic density constant is strictly positive, and the counting function satisfies as .✦
The Claim
Theorem 1. Let be irreducible over of degree , set , and suppose that is locally admissible for . When , an asymptotic density statement holds in (4) and (5); when , it holds in (6): (4)✦ (5)✦ (6)✦
What Is Checked
The claims (4) and (5) for degree and (6) for are stated over polynomials irreducible over with exponent satisfying local admissibility for , in terms of -power-free integers, the counting function , the modular root counts , the local factors at each prime, and the asymptotic density constant .