No label defined (Q4949667)

Let \(d(n)\) denote the number of divisors of \(n\), and \(\omega(n)\) and \(\Omega(n)\) the number of distinct and the number of all prime factors of an integer \(n \geq 1\), respectively. The aim of this paper is to prove the following asymptotic formula: Let \[ T_1(N,\sigma,g) = \sum_{n<N}g^\sigma(n)d(n-1),\qquad T_2(N,\sigma,g) = \sum_{n<N}g^\sigma(n)d(N-n), \] where \(g(n) = \omega(n)\) or \(g(n) = \Omega(n)\) and \(|\sigma|\leq {1\over 3}(\log\log N)^{1/3}\). Then for \(i = 1,2\) we have, uniformly in \(\sigma\), \[ T_i(N,\sigma,g) = N\log N(\log\log N)^\sigma\left(1 + O\left({|\sigma|+\log\log\log N\over(\log\log N)^{1/3}}\right)\right). \] The proof is based on asymptotic formulas for the sums \[ S_1(N,k,g) = \sum_{n<N,g(n)=k}d(n-1),\qquad S_2(N,k,g) = \sum_{n<N,g(n)=k}d(N-n), \] due to the author and \textit{N. M. Timofeev} [Mat. Zametki 55, 144-156 (1994; Zbl 0839.11038), ibid. 59, 144-156 (1996; Zbl 0886.11055) and ibid. 63, 749-762 (1998; Zbl 0923.11131)].