The Setting
Take a primitive polynomial of degree that is irreducible over , and write for the power-freeness exponent, where an integer is -free if no prime -th power divides . In studying -free values of on dyadic ranges, the question is what explicit power-saving bound of the form , with real constants and , holds for the dyadic tail at all sufficiently large scales .
Definitions
For a polynomial and natural numbers and , the dyadic tail count is defined by .
The Claim
Theorem 1. Let be a primitive polynomial of degree that is irreducible over , and put .
If and has positive leading coefficient, then there exists a real constant such that for all sufficiently large natural numbers , (1)✦
If and has positive leading coefficient, then there exists a real constant such that for all sufficiently large natural numbers , (2)✦
If , then there exists a real constant such that for all sufficiently large natural numbers , (3)✦
In the paper, the result reads: for a primitive and irreducible polynomial with positive leading coefficient and degree , putting , there exists such that .
What Is Checked
Each of (1), (2), and (3) is stated over primitive polynomials of degree irreducible over , with positive leading coefficient when or and with no sign condition on the leading coefficient when , together with the dyadic tail count at exponent and natural-number scales.