2000 character limit reached
Powerfree Values of Polynomials
Published 10 Mar 2011 in math.NT | (1103.2028v1)
Abstract: For irreducible integer polynomials $f(n)=nd+c$ we prove an asymptotic formula for the number of $k$-th power free values taken by $f(n)$, for $n$ running up to $x$, subject to the condition $k\ge (5d+3)/9$. This improves earlier results in which the condition was $k\ge (3d+1)/4$. We also show that one can handle $f(p)$ for prime arguments $p$, for the same range of $k$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.