The distribution of \(k\)-full and \(l\)-free numbers (Q1969635)

The authors provide estimates for the function \[ \Delta_{k,l}(x) = N_{k,l}(x) - \sum_{n=k}^{\min(2k,l)-1}c_{k,l}^{(n)}x^{1/n}, \] where \(l \geq k+2 \geq 4\) are given numbers, the constants \(c_{k,l}^{(n)}\) are effectively computable and \(N_{k,l}(x)\) denotes the number of integers \(m\) not exceeding \(x\) such that \(k \leq \alpha < l\) if \(p^\alpha ||m\). Thus \(N_{k,l}(x)\) denotes the number of \(k\)-full integers not exceeding \(x\) which are at the same time \(l\)-free. The problem of the estimation of \(\Delta_{k,l}(x)\) is connected with the so-called unsymmetric divisor problem, for which there are several existing results, which are used to prove two theorems. Theorem 1 gives the bound \[ \Delta_{k,l}(x) \ll x^{1/(2k)}\exp\left(-A_{k,l}(\log x)^{3/5} (\log\log x)^{-1/5}\right) \] for \(l = k+2 \leq 2k, l = k + 3 \leq 2k, l = k+ 4, k = 4,5,6,7, (k,l) = (5,10), \) and also \[ \Delta_{4,9} \ll x^{1/9}\exp\left(-A_{4,9}(\log x)^{3/5} (\log\log x)^{-1/5}\right). \] Theorem 2 furnishes conditional bounds, since the Riemann hypothesis is assumed.