On a result of Erdős and Ivić (Q1842003)

Let \(B(n)\) denote the sum of all prime factors of \(n>1\), and let \(B_ 1(n)\) denote the sum of distinct prime powers that exactly divide \(n\). Asymptotic formulas for the sum of the quotient of \(B_ 1(n)\) and \(B(n)\) have been obtained by \textit{P. Erdős} and \textit{A. Ivić} [Stud. Sci. Math. Hung. 15, 183-199 (1980; Zbl 0499.10051)]. The purpose of the present paper is to improve the result as follows: Theorem. \[ \sum_{2\leq n\leq x} {{B_ 1(n)} \over {B(n)}}= D'x+ {{e^ \gamma} \over 2} {{x\log^ 2_ 2 x} \over {\log x}}+ O\biggl( {{x (\log_ 2 x)^{5/3+ \varepsilon}} \over {\log x}} \biggr), \] where \(D'\) is given by \(D'= \sum_{\alpha=1}^ \infty {1\over\alpha} \int_ 0^{+\infty} {{\rho(s)} \over {s+\alpha}} ds\) and \(\gamma\) denotes Euler's constant. Remark. The exponent \(5/3+ \varepsilon\) comes from the error term in the prime number theorem and can be replaced by \(c>1\) if the prime number theorem is assumed to hold with error term \(O(\exp \{-(\log x)^{1/c}\})\). If the Riemannian hypothesis is assumed, the error term \(O(x (\log_ 2 x)^{5/3+ \varepsilon}/\) \(\log x)\) can be improved to \(O(x \log_ 2 x\log_ 3 x/\log x)\).