An extension of a result of Erd\"os and Zaremba
Michel Jean Georges Weber

TL;DR
This paper extends a classical result by Erd"os and Zaremba on the asymptotic behavior of a divisor sum function, introducing a new function and approach, with applications to inequalities involving gcd and divisor functions.
Contribution
The paper generalizes Erd"os and Zaremba's limit result to a new function involving logs and develops a novel proof technique, also improving related inequalities.
Findings
Established the asymptotic limit of the new function (n) involving logs.
Developed a new approach to prove the limit, different from previous methods.
Improved bounds on sums involving gcd and divisor functions.
Abstract
Erd\"os and Zaremba showed that , being Euler's constant, where . We extend this result to the function and some other functions. We show that . The proof requires to develop a new approach. As an application, we prove that for any , any finite sequence of reals , , where depends on only. This improves a recent result obtained by the author.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
