Almost perfect number
In mathematics, an almost perfect number (sometimes also called slightly defective or least deficient number) is a natural number n such that the sum of all divisors of n (the sum-of-divisors function σ(n)) is equal to 2n − 1, the sum of all proper divisors of n, s(n) = σ(n) − n, then being equal to n − 1. The only known almost perfect numbers are powers of 2 with non-negative exponents (sequence A000079 in the OEIS). Therefore the only known odd almost perfect number is 20 = 1, and the only known even almost perfect numbers are those of the form 2k for some positive integer k; however, it has not been shown that all almost perfect numbers are of this form. It is known that an odd almost perfect number greater than 1 would have at least six prime factors.<ref name=Kis1978>Template:Cite journal</ref><ref name=Kis1981>Template:Cite journal</ref>
If m is an odd almost perfect number then Template:Nowrap is a Descartes number.<ref name=BGNS>Template:Cite book</ref> Moreover if a and b are positive odd integers such that <math>b+3<a<\sqrt{m/2}</math> and such that Template:Nowrap and Template:Nowrap are both primes, then Template:Nowrap would be an odd weird number.<ref> Template:Cite journal </ref>
See alsoEdit
ReferencesEdit
Further readingEdit
External linksEdit
Template:Divisor classes Template:Classes of natural numbers