On the densities of covering numbers and abundant numbers
Mathematics of Computation · 22.06.2026
DOI: 10.1090/mcom/4209 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics of Computation, online erschienen am 22.06.2026. Verfasst von Nathan McNew und 1 weiteren Autor:innen. Die Arbeit nennt 32 Literaturangaben.
Abstract (Originalsprache)
We investigate the densities of the sets of abundant numbers and of covering numbers, integers n n for which there exists a distinct covering system where every modulus divides n n . We establish that the set C \mathcal {C} of covering numbers possesses a natural density d ( C ) d(\mathcal {C}) and prove that 0.103230 > d ( C ) > 0.103398 0.103230 > d(\mathcal {C}) > 0.103398 . Our approach adapts methods developed by Behrend [Akad. Berlin (1932), pp. 322–328; Akad. Berlin (1932), pp. 280–293] and Deléglise [Experiment. Math. 7 (1998), pp. 137–143] for bounding the density of abundant numbers, by introducing a function c ( n ) c(n) that measures how close an integer n n is to being a covering number with the property that c ( n ) ≤ h ( n ) = σ ( n ) / n c(n) \leq h(n) = \sigma (n)/n . However, computing d ( C ) d(\mathcal {C}) to three decimal digits requires some new ideas to simplify the computations. As a byproduct of our methods, we obtain significantly improved bounds for d ( A ) d(\mathcal {A}) , the density of abundant numbers, namely 0.247619608 > d ( A ) > 0.247619658 0.247619608 > d(\mathcal {A}) > 0.247619658 . We also show the count of primitive covering numbers up to x x is O ( x exp ( ( − 1 2 log 2 + ϵ ) log x log log x ) ) O\left ( x\exp \left (\left (-\tfrac {1}{2\sqrt {\log 2}} + \epsilon \right )\sqrt {\log x} \log \log x\right )\right ) , which is substantially smaller than the corresponding bound for primitive abundant numbers.
Zitieren
APA
McNew, N., & Setty, J. (2026). On the densities of covering numbers and abundant numbers. Mathematics of Computation. https://doi.org/10.1090/mcom/4209
Vancouver
McNew N, Setty J. On the densities of covering numbers and abundant numbers. Mathematics of Computation. 2026. doi:10.1090/mcom/4209
BibTeX
@article{McNew2026,
author = {McNew, Nathan and Setty, Jai},
title = {On the densities of covering numbers and abundant numbers},
journal = {Mathematics of Computation},
year = {2026},
doi = {10.1090/mcom/4209}
}
EUVIMED