No CrossRef data available.
Published online by Cambridge University Press: 16 May 2025
A square-full number is a positive integer for which all prime divisors divide the number at least twice. For a relatively prime pair $(a,b)\in \mathbb N\times \mathbb N\cup \{0\}$ and an affine polynomial
$f(x)=ax+b$, the number of
$n\leqslant N$ such that
$f(n)$ is square-full is of order
$N^{{1}/{2}}$. For
$\varepsilon>0$ and an admissible quadratic polynomial
$f(x)\in \mathbb Z[x]$, we show that the number of
$n\leqslant N$ such that
$f(n)$ is square-full is at most
$O_{\varepsilon ,f}(N^{\varpi +\varepsilon })$ for some absolute constant
$\varpi <1/2$. Under the
$abc$ conjecture, we expect the upper bound to be
$O_{\varepsilon ,f}(N^\varepsilon )$.