Powerfree Values of Polynomials

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 (5d+3)/9. This improves earlier results in which the condition was k (3d+1)/4. We also show that one can handle f(p) for prime arguments p, for the same range of k.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…