Given an integer and the subsets of its proper divisors and (thus where is the divisor function), is there at least one subset whose elements add up to ? If yes, then is a semiperfect number or pseudoperfect number.
Since the complete set of proper divisors is also technically considered a subset, then a fully perfect number is also a semiperfect number. Perhaps just as obviously, no deficient number can be semiperfect; thus all semiperfect numbers are either abundant numbers or perfect numbers.
If the abundance happens to be a divisor of , then the divisor subset that excludes is the obvious choice, but some semiperfect numbers are so in more than one way: 12 for example can be expressed as 1 + 2 + 3 + 6 but also as 2 + 4 + 6.
Just as a multiple of an abundant number is another abundant number, so is the multiple of a semiperfect number another semiperfect number.
The first few semiperfect numbers that are not multiples of perfect numbers are 20, 40, 80, 88. A005835 of Sloane’s OEIS lists all the semiperfect numbers less than 265 and provides a simple means of reckoning them, by counting the number of partitions of into distinct divisors and culling those that have more than 1.
|Date of creation||2013-03-22 16:18:33|
|Last modified on||2013-03-22 16:18:33|
|Last modified by||CompositeFan (12809)|