Abstract

A square-full\textit{square-full} 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 f(n)f(n) for n⩽Nn\leqslant N is denoted by Sf(■(N)S^{{\mathstrut\hspace{0.05em}\blacksquare}}_f(N). We have known that for a relatively prime pair (a,b)∈N×N∪{0}(a,b)\in\mathbb N\times \mathbb N\cup\{0\} with a linear polynomial f(x)=ax+bf(x)=ax+b, its counting function is ≍a,bN12\asymp_{a,b} N^\frac{1}{2}. Fix ε>0\varepsilon>0, for an admissible quadratic polynomial f(x)f(x), we prove that Sf(■(N)≪ε,fNϖ+εS^{{\mathstrut\hspace{0.05em}\blacksquare}}_f(N)\ll_{\varepsilon, f} N^{\varpi+\varepsilon} for some absolute constant ϖ<1/2\varpi<1/2. Under the assumption on the abcabc conjecture, we expect the upper bound to be Oε,f(Nε)O_{\varepsilon,f}(N^\varepsilon).

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.