Iterated logarithm approximations to the distribution of the largest prime divisor

arXiv0903.2712MaRDI QIDQ6213136FDOQ6213136

Authors: Arie Leizarowitz 

Publication date: 16 March 2009

Abstract: The paper is concerned with estimating the number of integers smaller than $x$ whose largest prime divisor is smaller than $y$, denoted $psi(x,y)$. Much of the related literature is concerned with approximating $psi(x,y)$ by Dickman's function $ho(u)$, where $u=lnx/lny$. A typical such result is that ${\displaystyle }$ psi (x,y)=x ho (u)(1+o(1)) eqno (1) ${\displaystyle }$ in a certain domain of the parameters $x$ and $y$. In this paper a different type of approximation of $psi(x,y)$, using iterated logarithms of $x$ and $y$, is presented. We establish that ${\displaystyle }$ ln (frac {psi}{x})=-u [ln ^{(2)}x-ln ^{(2)}y+ln ^{(3)}x-ln ^{(3)}y+ln ^{(4)}x-a] eqno (2) ${\displaystyle }$ where $$ for some constants $underbara$ and $$ (denoting by $l{n}^{(k)}x=ln\mathrm{...}lnx$ the $k$-fold iterated logarithm). The approximation (2) holds in a domain which is complementary to the one on which the approximation (1) is known to be valid. One consequence of (2) is an asymptotic expression for Dickman's function, which is of the form $lnho(u)=-u[lnu+l{n}^{(2)}u](1+o(1))$, improving known asymptotic approximations of this type. We employ (2) to establish a version of Bertrand's Conjecture, and indicate how this method may be used to sharpen the result.

This page was built for publication: Iterated logarithm approximations to the distribution of the largest prime divisor

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