# semiperfect number

Given an integer $n$ and the subsets of its proper divisors ${d}_{i}|n$ and $$ (thus $$ where $\tau $ is the divisor function^{}), is there at least one subset whose elements add up to $n$? If yes, then $n$ 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 $a(n)$ happens to be a divisor^{} of $n$, then the divisor subset that excludes $a(n)$ 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 $n$ into distinct divisors and culling those that have more than 1.

All primary pseudoperfect numbers (except 2) are also semiperfect. An abundant number that is not semiperfect is a weird number.

Title | semiperfect number |
---|---|

Canonical name | SemiperfectNumber |

Date of creation | 2013-03-22 16:18:33 |

Last modified on | 2013-03-22 16:18:33 |

Owner | CompositeFan (12809) |

Last modified by | CompositeFan (12809) |

Numerical id | 5 |

Author | CompositeFan (12809) |

Entry type | Definition |

Classification | msc 11D85 |

Synonym | pseudoperfect number |