On the distribution of square-full and cube-full integers (Q1277240)

A positive integer is said to be \(k\)-full if each prime factor divides it at least to the \(k\)-th power. Let \(N_k(x)\) denote the number of \(k\)-full integers not exceeding \(x\), and let \(\Delta_k(x)\) be the error term in the asymptotic formula for \(N_k(x)\). Using new results on the estimation of exponential sums, it is proved that under Riemann's hypothesis \[ \Delta_2(x)\ll x^{1/7+ \varepsilon}, \quad \Delta_3(x)\ll x^{97/804+ \varepsilon}\quad (\varepsilon >0). \] These estimates improve those of \textit{X.-D. Cao} [Period. Math. Hung. 28, 43--54 (1994; Zbl 0803.11047)] and \textit{W. G. Nowak} [Analysis, geometry and groups: A Riemann legacy volume (eds. H. M. Srivastava and T. M. Rassias), Hadronic Press, Palm Harbor, 449--470 (1993; Zbl 0914.11052)]. Further, a positive integer \(n_{k,\ell}\) is said to be \(k\)-full and \(\ell\)-free \((2\leq k<\ell)\) if each prime divisor has the property \(p^k| n_{k,\ell}\) and \(p^\ell\nmid n_{k,\ell}\). Then results of the reviewer [\textit{E. Krätzel}, Monatsh. Math. 120, 105--119 (1995; Zbl 0838.11059)] on the distribution of \(k\)-full and \(\ell\)-free numbers in short intervals are sharpened.