Deficient number

In number theory, a deficient number or defective number is a positive integer n for which the sum of divisors of n is less than 2n. Equivalently, it is a number for which the sum of proper divisors (or aliquot sum) is less than n. For example, the proper divisors of 8 are 1, 2, and 4, and their sum is less than 8, so 8 is deficient.
Examples
The first few deficient numbers are
- 1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 21, 22, 23, 25, 26, 27, 29, 31, 32, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 46, 47, 49, 50, ... (sequence A005100 in the OEIS)
As an example, consider the number 21. Its proper divisors are 1, 3 and 7, and their sum is 11. Because 11 is less than 21, the number 21 is deficient. Its deficiency is 21 − 11 = 10.
Properties
Since the aliquot sums of prime numbers equal 1, all prime numbers are deficient.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. More generally, all odd numbers with one or two distinct prime factors are deficient. It follows that there are infinitely many odd deficient numbers. There are also an infinite number of even deficient numbers as all powers of two have the sum (1 + 2 + 4 + 8 + ... + 2x − 1 = 2x − 1). The infinite family of numbers of form 2n − 1 × pm where m > 0 and p is a prime > 2n − 1 are also deficient.
More generally, all prime powers are deficient, because their only proper divisors are which sum to , which is at most .Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
All proper divisors of deficient numbers are deficient.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. Moreover, all proper divisors of perfect numbers are deficient.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
There exists at least one deficient number in the interval for all sufficiently large n.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
Related concepts
Template:Euler diagram numbers with many divisors.svg Closely related to deficient numbers are perfect numbers with σ(n) = 2n, and abundant numbers with σ(n) > 2n.
Nicomachus was the first to subdivide numbers into deficient, perfect, or abundant, in his Introduction to Arithmetic (circa 100 CE). However, he applied this classification only to the even numbers.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
See also
Notes
Page Template:Reflist/styles.css has no content.
References
- Page Module:Citation/CS1/styles.css has no content.Dickson, Leonard Eugene (1919). History of the Theory of Numbers, Vol. I: Divisibility and Primality. Carnegie Institute of Washington.
- Page Module:Citation/CS1/styles.css has no content.Prielipp, Robert W. (1970). "Perfect numbers, abundant numbers, and deficient numbers". The Mathematics Teacher. 63 (8): 692–696. doi:10.5951/MT.63.8.0692. JSTOR 27958492.
- Page Module:Citation/CS1/styles.css has no content.Sándor, József; Mitrinović, Dragoslav S.; Crstici, Borislav, eds. (2006). Handbook of number theory I. Dordrecht: Springer-Verlag. ISBN 1-4020-4215-9. Zbl 1151.11300.
External links
- The Prime Glossary: Deficient number
- Script error: No such module "Template wrapper".
- deficient number at PlanetMath.
Lua error in package.lua at line 80: module 'Module:Navbox/configuration' not found. Lua error in package.lua at line 80: module 'Module:Navbox/configuration' not found.