Abundant number

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In number theory, an abundant number or excessive number is a number n for which the sum of divisors σ(n)>2n, or, equivalently, the sum of proper divisors (or aliquot sum) s(n)>n. The value σ(n)-2n (or s(n)-n) is known as the abundance.

Contents

[edit] Examples

The first few abundant numbers are:

12, 18, 20, 24, 30, 36, 40, 42, 48, 54, 56, 60, 66, 70, 72, 78, 80, 84, 88, 90, 96, 100, 102, … (sequence A005101 in OEIS).

For example, the divisors of 24 are 1, 2, 3, 4, 6, 8, 12 and 24, whose sum is 60. Because 60 is more than 2 × 24, the number 24 is abundant. Its abundance is 60 − (2 × 24) = 12.

[edit] Properties

  • The smallest odd abundant number is 945
  • The smallest not divisible by 2 or by 3 is 5391411025 whose prime factors are 5, 7, 11, 13, 17, 19, 23, and 29. An algorithm given by Iannucci in 2005 shows how to find the smallest abundant number not divisible by the first k primes.[1] If A(k) represents the smallest abundant number not divisible by the first k primes then for all \epsilon>0 we have:
 (1-\epsilon)(k\ln k)^{2-\epsilon}<\ln A(k)<(1+\epsilon)(k\ln k)^{2+\epsilon} for k sufficiently large.
  • Every proper multiple of a perfect number, and every multiple of an abundant number, is abundant.
  • Every integer greater than 20161 can be written as the sum of two abundant numbers.[3]

[edit] Related concepts

Closely related to abundant numbers are perfect numbers, that is numbers the sum of whose proper factors equals the number itself (such as 6 and 28) (or more formally, σ(n) = 2n), and deficient numbers, or numbers the sum of whose proper factors is less than the number itself (or σ(n) < 2n.) The natural numbers were first classified as either deficient, perfect or abundant by Nicomachus in his Introductio Arithmetica (circa 100) who described abundant numbers as like deformed animals with too many limbs.

[edit] External links

[edit] References

  1. ^ D. Iannucci (2005), "On the smallest abundant number not divisible by the first k primes", Bulletin of the Belgian Mathematical Society 12 (1): 39–44, http://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.bbms/1113318127 
  2. ^ M. Deléglise (1998), "Bounds for the density of abundant integers", Experimental Mathematics 7 (2): 137–143, http://projecteuclid.org/DPubS/Repository/1.0/Disseminate?view=body&id=pdf_1&handle=euclid.em/1048515661 
  3. ^ Sloane's A048242 : Numbers that are not the sum of two abundant numbers. The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
Personal tools
Namespaces

Variants
Actions
Navigation
Interaction
Toolbox
Print/export
Languages