Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T06:25:45.009Z Has data issue: false hasContentIssue false

THE ERROR TERM IN THE COUNT OF ABUNDANT NUMBERS

Published online by Cambridge University Press:  02 January 2014

Mitsuo Kobayashi
Affiliation:
Department of Mathematics and Statistics, Cal Poly Pomona, Pomona, CA 91768, U.S.A. email mkobayashi@csupomona.edu
Paul Pollack
Affiliation:
Department of Mathematics, University of Georgia, Athens, GA 30602,U.S.A. email pollack@uga.edu

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A natural number $n$ is called abundant if the sum of the proper divisors of $n$ exceeds $n$. For example, $12$ is abundant, since $1+ 2+ 3+ 4+ 6= 16$. In 1929, Bessel-Hagen asked whether or not the set of abundant numbers possesses an asymptotic density. In other words, if $A(x)$ denotes the count of abundant numbers belonging to the interval $[1, x] $, does $A(x)/ x$ tend to a limit? Four years later, Davenport answered Bessel-Hagen’s question in the affirmative. Calling this density $\Delta $, it is now known that $0. 24761\lt \Delta \lt 0. 24766$, so that just under one in four numbers are abundant. We show that $A(x)- \Delta x\lt x/ \mathrm{exp} (\mathop{(\log x)}\nolimits ^{1/ 3} )$ for all large $x$. We also study the behavior of the corresponding error term for the count of so-called $\alpha $-abundant numbers.

Information

Type
Research Article
Copyright
Copyright © University College London 2014