PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: Very low
abundant number (Definition)

An integer $ n$ is an abundant number if the sum of the proper divisors of $ n$ is more than $ n$ itself, or the sum of all the divisors is more than twice $ n$. That is, $ \sigma(n) > 2n$, with $ \sigma(n)$ being the sum of divisors function.

For example, the integer 30. Its proper divisors are 1, 2, 3, 5, 6, 10, 15, which add up to 42.

Multiplying a perfect number by some integer $ x$ gives an abundant number (as long as $ x > 1$).

Given a pair of amicable numbers, the lesser of the two is abundant, its proper divisors adding up to the greater of the two.



"abundant number" is owned by CompositeFan.
(view preamble)

View style:

See Also: amicable numbers


Attachments:
theorem on multiples of abundant numbers (Theorem) by CompositeFan
abundance (Definition) by CompositeFan
quasiperfect number (Definition) by CompositeFan
every even integer greater than 46 is the sum of two abundant numbers (Theorem) by PrimeFan
positive multiple of an abundant number is abundant (Theorem) by Mathprof
every sufficiently large even integer can be expressed as the sum of a pair of abundant numbers (Proof) by rspuzio
formula for sum of divisors (Theorem) by rspuzio
colossally abundant number (Definition) by CompositeFan
every even integer greater than 70 is the sum of two abundant numbers in more than one way (Theorem) by PrimeFan
Log in to rate this entry.
(view current ratings)

Cross-references: amicable numbers, perfect number, sum of divisors function, divisors, proper divisors, sum, integer
There are 19 references to this entry.

This is version 3 of abundant number, born on 2006-04-25, modified 2007-11-21.
Object id is 7869, canonical name is AbundantNumber.
Accessed 4093 times total.

Classification:
AMS MSC11A05 (Number theory :: Elementary number theory :: Multiplicative structure; Euclidean algorithm; greatest common divisors)

Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)