Approximating the divisor functions
Andrew Echezabal, Laura De Carli, Maurizio Laporta

TL;DR
This paper introduces a novel approach to approximate divisor functions using a sequence of functions and an analytical delta-like sequence, providing a new proof of Gronwall's theorem on their asymptotic behavior.
Contribution
It presents a new proof of Gronwall's theorem by combining approximation techniques with delta-like sequences, advancing understanding of divisor functions.
Findings
New proof of Gronwall's theorem established
Approximation methods effectively analyze divisor functions
Analytical delta-like sequences enhance asymptotic analysis
Abstract
We exploit the properties of a sequence of functions that approximate the divisor functions and combine them with an analytical formula of a delta-like sequence to give a new proof of a theorem of Gronwall on the asymptotic of the divisor functions.
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.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Numerical Methods and Algorithms
