The distribution of numbers with many ordered factorizations (Q2240430)

Let \(g(n)\) denote the number of ordered factorizations of \(n\). The first important result on the average order of \(g(n)\) was obtained by \textit{L. Kalmár} [Acta Litt. Sci. Szeged 5, 95--107 (1931; Zbl 0001.12703)]. His result has been improved many times. The author of this paper considers the problem of bounding the positive moments of \(g(n)\). He obtains various bounds for these moments. We quote only Theorem 4.3, which states that \(\sum_{n\le x} (g(n)^{\beta}= x.\exp((\log x)^{0(1)})\) for all \(\beta>0\) and \(\beta < 1/\rho\), where \(\rho\) is the unique solution to the equation \(\zeta(s)=2\), \(\zeta(s)\) denoting the Riemann zeta function. The author obtains also bounds for the similar functions of the number of factorizations of \(n\) into distinct parts greater than 1, or for the number of ordered factorizations of \(n\) into coprime parts greater that 1, and finally for the number of factorizations of \(n\) into prime parts.