Powerfree Values of Polynomials

preprint2011arXivOpen access

Abstract

For irreducible integer polynomials f(n)=nd+cf(n)=n^d+c we prove an asymptotic formula for the number of kk-th power free values taken by f(n)f(n), for nn running up to xx, subject to the condition k≥(5d+3)/9k\ge (5d+3)/9. This improves earlier results in which the condition was k≥(3d+1)/4k\ge (3d+1)/4. We also show that one can handle f(p)f(p) for prime arguments pp, for the same range of kk.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.