Colossally abundant number
Encyclopedia : C : CO : COL : Colossally abundant number
In mathematics, a colossally abundant number (sometimes abbreviated as CA) is a certain kind of natural number. Formally, a number n is colossally abundant iff there is an ε > 0 such that for all k > 1,
- [\frac}\geq\frac}]
Properties
All colossally abundant numbers are Harshad numbers.Relation to the Riemann hypothesis
If the Riemann hypothesis is false, a colossally abundant number will be a counterexample. In particular, the RH is equivilent to the assertion that the sigma, the sum of the divisors of n, follows this constraint for n >= 5041:- [\sigma(n)<\exp(\gamma) \cdot n \log\log n]
LagariasJ. C. Lagarias, [An elementary problem equivalent to the Riemann hypothesis], American Mathematical Monthly 109 (2002), pp. 534-543. and SmithWarren D. Smith, [A "good" problem equivalent to the Riemann hypothesis], 2005 discuss this and similar formulations of the RH.
See also
External links
- [Keith Briggs on colossally abundant numbers and the Riemann hypothesis]
- [MathWorld entry]
- [Notes on the Riemann hypothesis and abundant numbers]
- [More on Robin's formulation of the RH]
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.
