On a problem of A. Ivić about the quotients of certain additive arithmetic functions (Q913849): Difference between revisions

Let \(\omega\) (n), \(\Omega\) (n) denote, as usual, the number of prime factors of n without and with multiplicity, respectively, and \(\beta\) (n), B(n) denote the corresponding functions for the sum of the prime factors of n. \textit{A. Ivić} [Boll. Unione Mat. Ital., VII. Ser., B 2, 79-97 (1988; Zbl 0644.10033)] showed that the number of integers n with \(1<n\leq x\) and \[ | \frac{B(n)}{\beta (n)}-\frac{\Omega (n)}{\omega (n)}| \quad \leq \quad (\log \log x)^{\epsilon -1}\quad equals\quad x+O(x(\log \log x)^{-C}) \] where \(\epsilon\) \((0<\epsilon <1)\) and \(C>0\) are fixed. The present author confirms a conjecture of A. Ivić by showing that for \(\epsilon >0\) and \(x\geq 4\), \[ (*)\quad x^{1- \epsilon}\quad \ll_{\epsilon}\quad T(x)-Q(x)\quad \ll \quad x(\log x)^ 2\quad \exp (-(1/5)(2 \log x \log \log x)^{1/2}) \] where Q(x) is the number of squarefree n with \(1<n\leq x\) and T(x) is the number of n with \(1<n\leq x\) and \(B(n)/\beta (n)=\Omega (n)/\omega (n).\) Reviewer's remark: On p. 378, in the third line of the proof of the lower bound, the last condition on the sum representing R(x) should be replaced by the simpler condition \(\beta (q)=p\omega (q)\), resulting in consequential modifications in the succeeding argument that do not appear to alter the lower bound claimed in (*).