For an integer , an integer is -power-free if no -th power of a prime divides . A -power-free integer is called squarefree. For a polynomial and a positive integer , let count the roots of modulo . For a real number , let . A polynomial is locally admissible for if for every prime . The associated Euler product is . The central problem is to determine which degrees and exponents guarantee the asymptotic with for every polynomial irreducible over of degree that is locally admissible for .
Ricci (1933) proved this asymptotic in the range . For , Erdős (1953) proved infinitude of -power-free values. In the same range , Hooley (1967) obtained the asymptotic for exponent , covering squarefree values of cubics. In 1953, Erdős singled out the unresolved squarefreeness of . Erdős (1965) returned to this example when describing the obstacle at exponent . Nair (1976) proved the asymptotic for , reaching for . Heath-Brown (2006) improved the range to , which covers for . Browning (2011) lowered the threshold to , attaining for . Xiao (2017) gave a published reproof of this result on with the Euler product over all residue classes modulo . For irreducible binomials , Heath-Brown (2013) proved a power-saving asymptotic for , which yields for . Reuss (2015) obtained a power-saving error for general degree- polynomials at exponent . Conditionally on the conjecture, Granville (1998) proved the predicted squarefree-value density for separable integer polynomials locally admissible for . Greaves (1992) studied squarefree values of binary forms. Helfgott (2004) treated squarefree values of homogeneous forms in two variables of degree at most six.
The preprint proves that if is irreducible over of degree with and is locally admissible for , then with , requiring neither primitivity nor a sign condition on the leading coefficient. For any integer and any nonempty finite family of nonzero polynomials in separable over whose nonconstant irreducible factors have degree at most , the integers at which every polynomial in the family takes a -power-free value have positive Euler-product density, provided that for every prime not every residue class satisfies for some polynomial in the family, which the Lean library does not contain.
The results on these pages are those of the Lean library, each stated as the Lean library states it and linked to the Lean declaration behind it. Lean has checked every result of the Lean library, so the Lean library is the reference. Where the preprint states a result differently, the statement on the page is the Lean library’s, with the preprint’s given beside it. The preprint is a guide only, giving the results their order and their names. The Lean library takes no external theorem as a hypothesis, proving the -power-free density statement unconditionally for all locally admissible polynomials irreducible over of degree rather than assuming Browning’s theorem for .
PowerFree is a Lean library: 19 items, in eight groups. Each has a page written by OctoInform, listed below.
No item matches.