Hostname: page-component-77c78cf97d-lmk9j Total loading time: 0 Render date: 2026-05-05T02:24:06.553Z Has data issue: false hasContentIssue false

Smooth integers and de Bruijn's approximation Ʌ

Published online by Cambridge University Press:  31 October 2023

Ofir Gorodetsky*
Affiliation:
Mathematical Institute, University of Oxford, Oxford OX2 6GG, UK (gorodetsky@maths.ox.ac.uk)
Rights & Permissions [Opens in a new window]

Abstract

This paper is concerned with the relationship of $y$-smooth integers and de Bruijn's approximation $\Lambda (x,\,y)$. Under the Riemann hypothesis, Saias proved that the count of $y$-smooth integers up to $x$, $\Psi (x,\,y)$, is asymptotic to $\Lambda (x,\,y)$ when $y \ge (\log x)^{2+\varepsilon }$. We extend the range to $y \ge (\log x)^{3/2+\varepsilon }$ by introducing a correction factor that takes into account the contributions of zeta zeros and prime powers. We use this correction term to uncover a lower order term in the asymptotics of $\Psi (x,\,y)/\Lambda (x,\,y)$. The term relates to the error term in the prime number theorem, and implies that large positive (resp. negative) values of $\sum _{n \le y} \Lambda (n)-y$ lead to large positive (resp. negative) values of $\Psi (x,\,y)-\Lambda (x,\,y)$, and vice versa. Under the Linear Independence hypothesis, we show a Chebyshev's bias in $\Psi (x,\,y)-\Lambda (x,\,y)$.

Information

Type
Research Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2023. Published by Cambridge University Press on behalf of The Royal Society of Edinburgh