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: Very high Entry average rating: Very high
proper divisor (Definition)

If a divisor $ d$ of $ n$ (that is, $ d\vert n$) satisfies $ 0 < \vert d\vert < \vert n\vert$, then $ d$ is a proper divisor of $ n$. In the realm of real positive integers, it is usually considered sufficient to list the positive divisors. For example, the proper divisors of 42 are 1, 2, 3, 6, 7, 14, 21.

By restricting the sum of divisors to proper divisors, some $ n$ will be less than this sum (deficient numbers, including prime numbers), some will be equal (perfect numbers) and some will be greater (abundant numbers). The term restricted divisor is sometimes used to further distinguish divisors in the range $ 1 < \vert d\vert < \vert n\vert$ (and sometimes it used to mean the same thing as proper divisor). Thus, in our example, the list would be shortened to 2, 3, 6, 7, 14, 21.



"proper divisor" is owned by CompositeFan.
(view preamble)

View style:

Other names:  aliquot part, restricted divisor

Attachments:
restricted divisors of the first 1000 positive integers (Example) by CompositeFan
Log in to rate this entry.
(view current ratings)

Cross-references: mean, range, term, abundant numbers, perfect numbers, prime numbers, deficient numbers, sum, sufficient, integers, positive, real, divisor
There are 19 references to this entry.

This is version 4 of proper divisor, born on 2006-04-23, modified 2007-03-30.
Object id is 7859, canonical name is ProperDivisor.
Accessed 2282 times total.

Classification:
AMS MSC11A51 (Number theory :: Elementary number theory :: Factorization; primality)

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)