Distribution of k-full integers (Q1119962)

Let \(k\in {\mathbb{Z}}\), \(k\geq 2\), be fixed. An integer n is said to be k-full if p \(| n\) implies \(p^ k | n\) for all primes p. Denote by \(A_ k(x)\) the number of positive k-full integers not exceeding x. It is well known that \[ A_ k(x)=\sum^{k- 1}_{i=0}c_{i,k}x^{1/(k+i)}+\Delta_ k(x) \] where \(\Delta_ k(x)=o(x^{1/(2k-1)})\) as \(x\to \infty\). However, the determination of \(\rho_ k=\inf \{\rho \in {\mathbb{R}}\); \(\Delta_ k(x)\ll x^{\rho}\}\) is an open problem. \textit{A. Ivić} [Publ. Inst. Math. 23(37), 85-94 (1978; Zbl 0384.10025)] proved that \(\rho_ k\leq 1/(2k)\) is implied by Lindelöf's hypothesis. The present author shows that on the assumption of Riemann's hypothesis \[ \rho_ k\geq a_ k:=\frac{r}{(r+1)(2k+r)},\quad k\geq 5, \] where \(r=[(1+\sqrt{8k+1})/2]\), and a similar estimate for \(2\leq k\leq 4\). This is done by proving that \(\int^{T}_{1}\Delta^ 2_ k(t)t^{-2a_ k-1} dt\) is not bounded as \(T\to \infty\). However, the author's lower bound for \(\rho_ k\) is given unconditionally in a recent paper by \textit{R. Balasubramanian}, \textit{K. Ramachandra} and \textit{M. V. Subbarao} [Acta Arith. 50, No.2, 107-118 (1988; Zbl 0652.10033)].