Abstract
A number is a positive integer for which all its prime divisors divide itself at least twice. The counting function of square-full integers of the form for is denoted by . We have known that for a relatively prime pair with a linear polynomial , its counting function is . Fix , for an admissible quadratic polynomial , we prove that for some absolute constant . Under the assumption on the conjecture, we expect the upper bound to be .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.