Local distribution of ordered factorizations of integers (Q5960973)

Let \(a_m(n)\) denote the number of ordered factorizations of \(n\) as a product of \(m\) factors, each of which is strictly greater than unity, so that \(a_m(n)\) is generated by \((\zeta(s) - 1)^m\), and let \(A(x,m) = \sum_{n\leq x}a_m(n)\). The author proves (by applying a weighted form of Perron's formula) two theorems, refining some results of the previous work of \textit{H.-K. Hwang} [J. Number Theory 81, 61-92 (2000; Zbl 1002.11071)]. The accent is on the uniformity in \(m\), plus a good bound for the error term \(E(x,m)\) in the asymptotic formula for \(A(x,m)\). For example, his Theorem 2 states that, uniformly for \(1 \leq m \leq \log^{3/5}x\), we have NEWLINE\[NEWLINEA(x,m)= x{(\log x-(1-\gamma)m-1)^{m-1}\over(m-1)!}\left\{ 1+\sum_{k=2}^{m-1}b_k(m)(\log x-(1-\gamma)m-1)^{-k}\right\} +E(x,m)NEWLINE\]NEWLINE with \(b_k(m) \ll (C_2k^{-1}m^3)^{k/2}\) and NEWLINE\[NEWLINEE(x,m)\ll x^{1-\alpha_m}(\log x)^{m-1}/(m-1)!,\quad\alpha_m = C_1m^{-2/3}, NEWLINE\]NEWLINE where \(\gamma\) is Euler's constant, and \(C_1, C_2 >0\) are constants. The proofs depend on the sharpest known bounds for \(\zeta(s)\) near the line \(\Re s = 1\).