The Setting
Take a polynomial of degree that is irreducible over , and set . For this asks how often is squarefree as runs through the positive integers, and for how often is free of prime -th powers. These notes go through the resulting asymptotic density theorems and the definitions they are built on.
Power-free Values and Local Densities
An integer is -free, for a nonnegative integer , if no prime -th power divides (so is excluded and negative integers are allowed).✦ The counting function associated to a polynomial , an integer , and a real number is (1)✦
For and an integer , the congruence root count is the number of residue classes with . At any prime , the local factor of for exponent is the real number .✦ Given and , the asymptotic density constant is the product of the local factors over all primes , (2)✦
A polynomial is locally admissible for an integer if for every prime .✦
The Claim
Theorem 1. Let be irreducible over of degree , set , and suppose is locally admissible for . When , (3)✦ For all , (4)✦ If , (5)✦
What Is Checked
Claims (3), (4), and (5) are stated for polynomials irreducible over of degree (satisfying , , and respectively) that are locally admissible for , in terms of -free integers, the counting function of (1), the congruence root count for , the local factors at primes , and the asymptotic density constant of (2).