Colossally abundant number

From Wikipedia, the free encyclopedia

Divisibility-based
sets of integers
Form of factorization:
Prime number
Composite number
Powerful number
Square-free number
Achilles number
Constrained divisor sums:
Perfect number
Almost perfect number
Quasiperfect number
Multiply perfect number
Hyperperfect number
Unitary perfect number
Semiperfect number
Primitive semiperfect number
Practical number
Numbers with many divisors:
Abundant number
Highly abundant number
Superabundant number
Colossally abundant number
Highly composite number
Superior highly composite number
Other:
Deficient number
Weird number
Amicable number
Sociable number
Sublime number
Harmonic divisor number
See also:
Divisor function
Divisor
Prime factor
Factorization

In mathematics, a colossally abundant number (sometimes abbreviated as CA) is a certain kind of natural number. Formally, a number n is colossally abundant if and only if there is an ε > 0 such that for all k > 1,

\frac{\sigma(n)}{n^{1+\varepsilon}}\geq\frac{\sigma(k)}{k^{1+\varepsilon}}

where σ denotes the divisor function. The first few colossally abundant numbers are 2, 6, 12, 60, 120, 360, 2520, 5040, ... (sequence A004490 in OEIS); all colossally abundant numbers are also superabundant numbers, but the converse is not generally true.

Contents

All colossally abundant numbers are Harshad numbers.

If the Riemann hypothesis is false, a colossally abundant number will be a counterexample. In particular, the RH is equivalent 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

This result is due to Robin[1].

Lagarias[2] and Smith[3] discuss this and similar formulations of the RH.

  1. ^ G. Robin, "Grandes valeurs de la fonction somme des diviseurs et hypothèse de Riemann", Journal de Mathématiques Pures et Appliquées 63 (1984), pp. 187-213.
  2. ^ J. C. Lagarias, An elementary problem equivalent to the Riemann hypothesis, American Mathematical Monthly 109 (2002), pp. 534-543.
  3. ^ Warren D. Smith, A "good" problem equivalent to the Riemann hypothesis, 2005

Retrieved from "http://en.wikipedia.org../../../c/o/l/Colossally_abundant_number.html"
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.