The fractional sum of small arithmetic functions
Joshua Stucky

TL;DR
This paper investigates sums involving arithmetic functions evaluated at the integer part of x/n, providing improved error bounds in their asymptotic formulas for certain cases.
Contribution
It introduces new techniques to refine the error estimates in the asymptotic analysis of fractional sums of small arithmetic functions.
Findings
Improved error bounds for specific arithmetic functions
Asymptotic formulas for sums involving floor functions
Enhanced understanding of fractional sums in number theory
Abstract
Motivated by recent results, we study sums of the form , where is an arithmetic function and denotes the greatest integer function. We show how the error term in the asymptotic formula for can be improved in some specific cases.
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.
