arXiv · 1207.0232
The Median Largest Prime Factor
Abstract
Let $M(x)$ denote the median largest prime factor of the integers in the interval $[1,x]$. We prove that $$M(x)=x^{\frac{1}{\sqrt{e}}\exp(-\text{li}_{f}(x)/x)}+O_{\epsilon}(x^{\frac{1}{\sqrt{e}}}e^{-c(\log x)^{3/5-\epsilon}})$$ where $\text{li}_{f}(x)=\int_{2}^{x}\frac{\{x/t\}}{\log t}dt$. From this, we obtain the asymptotic $$M(x)=e^{\frac{\gamma-1}{\sqrt{e}}}x^{\frac{1}{\sqrt{e}}}(1+O(\frac{1}{\log x})),$$ where $\gamma$ is the Euler Mascheroni constant. This answers a question posed by Martin, and improves a result of Selfridge and Wunderlich.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Eric Naslund. 2012-07-01. The Median Largest Prime Factor. https://doi.org/10.1016/j.jnt.2013.12.018
Cite the original work for its findings. Save a collection to share your selection of sources.