Abstract
We say that an integer $n$ is abundant if the sum of the divisors of $n$ is at least $2n$. It has been known [wall71] that the set of abundant numbers has a natural density $A(2)$ and that $0.244 < A(2) < 0.291$. We give the sharper bounds $0.2474 < A(2) < 0.2480$.
Citation
Marc Deléglise. "Bounds for the density of abundant integers." Experiment. Math. 7 (2) 137 - 143, 1998.
Information
Published: 1998
First available in Project Euclid: 24 March 2003
zbMATH: 0923.11127
MathSciNet: MR1677091
Subjects:
Primary:
11N60
Rights: Copyright © 1998 A K Peters, Ltd.
