Normal largest gap between prime factors (Q2199519): Difference between revisions

In private correspondence E. Sofos asked the author about normal and upper bounds for the function \(f(n)=\max_{1\le j<\omega(n)} \log\left(\log p_{j+1}(n))/\log p_j(n)\right)\), where \(p_1(n)< \cdots < p_{\omega(n)}\) are the distinct prime factors of \(n\) arranged increasingly. The author points out that in [Can. J. Math. 11, 161--167 (1959; Zbl 0092.04301)] \textit{P. Erdős} states without proof that for any \(c>0\) the density of the positive integers \(n\) with \(e^{f(n)}>c\log n\) is \(1-e^{-1/c}\). In this short note, the author gives a short proof of this statement in Erdős style.