On the largest prime factors of \(n\) and \(n+1\) (Q1247448)

The authors prove some interesting results which give a comparison of the largest prime factors of \(n\) and \(n+1\). Let \(P(n)\) denote the largest prime factor of \(n\). Then one of the impressive results proved is that the number of \(n\leq x\) for which \(P(n)> P(n+1)\) is \(\gg x\) for all large \(x\). Another of them is about numbers \(n\) for which \(f(n)=f(n+1)\) where by \(f(n)\) we mean \(\sum_{p_i^{a_{i}}\|n}a_\cdot p_i\). Such numbers are called Aaron numbers. The authors prove that the number of Aaron numbers \(\leq x\) is \(O_{\varepsilon}(x(\log x)^{-1+\varepsilon})\). The results can find other attractive results in the body of the paper.