Note on the \(h\)th power means of distinct prime divisors of composite positive integers (Q548394)

Define \(\mathcal{P}_h(n)\) to be the \(h\)-th power mean of the prime divisors of \(n\), that is, \[ \mathcal{P}_h(n) = \Big(\frac{1}{\omega(n)}\sum_{p|n} p^h\Big)^{1/h}. \] Define \(\mathcal{A}_h(x)\) to be the number of integers \(n\leq x\), such that \(\mathcal{P}_h(n)\) is a prime divisor of \(n\). The authors show that \[ \frac{x}{\exp(2\sqrt{h}\sqrt{\log x\log\log x})} \leq \mathcal{A}_h(x) \leq \frac{x}{\exp(\sqrt{1/2}\sqrt{\log x\log\log x})}. \] For \(h=1\) this was essentially shown by \textit{F. Luca} and \textit{F. Pappalardi} [Acta Arith. 129, 197--201 (2007; Zbl 1151.11049)]. The main difference between the present article and the argument for the case \(h=1\) is that the construction yielding the lower bound uses results of Goldbach-Waring type. However, since the number of summands tends to infinity with \(x\), the most elementary results of this type suffice.