On the consecutive prime divisors of an integer (Q2119393)

Let \(n\geqslant 2\) be an integer number. For this \(n\) let \(\omega(n)\) denote the number of distinct prime divisors and let \(p_1(n)<p_2(n)<\ldots<p_{\omega(n)}(n)\) be these prime divisors. For a given integer \(n\) and a prime divisor \(p\) of \(n\) (that is less than the largest prime divisor of \(n\)), let \( \nu_p(n)=\min\{q|n:q>p\}. \) Authors of the paper consider asymptotic properties of the quantity \[ U_\lambda(n)=\sum_{\substack{p|n \\ \frac{\log p}{\log\nu_p(n)}<\lambda}}1, \] where parameter \(\lambda\in(0,1]\). In particular, authors of the paper obtain that \[ \sum_{n\leqslant x}U_\lambda(n)=(1+o(1))\lambda x\log\log x \] as \(x\rightarrow\infty\), and that \[ \lim_{x\rightarrow\infty}\frac{1}{x}\#\bigg\{n\leqslant x:\Big|\frac{U_\lambda(n)}{\omega(n)}-\lambda\Big|>\varepsilon\bigg\}=0 \] for an arbitrary positive \(\varepsilon\). The asymptotic behaviour of other sums similar to \(\sum_{n\leqslant x}U_\lambda(n)\) are also considered in the paper.