Normal largest gap between prime factors

From MaRDI portal
Publication:2199519




Abstract: Let pj(n)j=1omega(n) denote the increasing sequence of distinct prime factors of an integer n. We provide details for the proof of a statement of ErdH{o}s implying that, for any function xi(n) tending to infinity with n, we have f(n):=max_{1leqslant j<omega(n)}log Big({log p_{j+1}(n)over log p_j(n)}Big)=log_3n+O(xi(n)) for almost all integers n.









This page was built for publication: Normal largest gap between prime factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199519)