Integers divisible by sums of powers of their prime factors (Q2474298): Difference between revisions

Let \(\beta_{j}(n)=\sum_{p\mid n}p^{j},\) \(\kappa(x)=\max\{k\geq 1:\beta_{j}(n)\mid n \text{ for all } j=1,\dots, k\text{ for some } n\leq x \text{ with } \omega(n)\geq 2\}\). In this paper, the authors prove: (1) If \(\omega(n)\geq 2\), there exist infinitely many positive integers \(n\) such that \(\beta_{j}(n)\mid n\) for all \(j=1,\dots, k\). (2) The estimate \(\kappa(x)\leq (\log x)/(4\log\log x)\) holds for all sufficiently large \(x\). The proof of (1) uses a result of Hua in additive prime number theory. The proof of (2) uses a result of Evertse in solutions to equation of integers.