On consecutive abundant numbers
Yong-Gao Chen, Hui Lv

TL;DR
This paper investigates the behavior of the maximum length of consecutive abundant numbers up to x, showing that the ratio of this length to log log log x converges to a limit between 3 and 4 as x approaches infinity.
Contribution
It proves that the ratio of the maximum consecutive abundant numbers to log log log x converges to an explicit limit, resolving a long-standing problem posed by Erdős.
Findings
The ratio E(x)/log log log x tends to a limit as x approaches infinity.
The limit value of this ratio is explicitly characterized and lies between 3 and 4.
The result confirms the conjectured growth rate of consecutive abundant numbers.
Abstract
A positive integer is called an abundant number if , where is the sum of all positive divisors of . Let be the largest number of consecutive abundant numbers not exceeding . In 1935, P. Erd\H os proved that there are two positive constants and such that . In this paper, we resolve this old problem by proving that, tends to a limit as , and the limit value has an explicit form which is between and .
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
TopicsAnalytic Number Theory Research · Algebraic Geometry and Number Theory · Limits and Structures in Graph Theory
