Subset-sum
Named by 3 essays across 2 fields — each of them below, with the objects they name alongside it.
Abundant, and still not a sum of its parts
Seventy's proper divisors add to seventy-four, more than seventy itself — and yet no selection of them adds to exactly seventy. The reason is that the excess, four, cannot be made from the small divisors one, two and five. Numbers like seventy are called weird; there are thirty-six below twenty thousand, every one of them even, and nobody knows whether an odd one exists.
Divisors that make every amount
Twelve's divisors — 1, 2, 3, 4, 6, 12 — can be chosen to add to every whole number from one to twenty-eight. Numbers like that are called practical, a test on their primes decides them, and they turn out to be counted like the primes: about 1.336 x / log x of them below x. For practical numbers Goldbach's conjecture and the twin conjecture are theorems.
Numbers whose subset sums all differ
The powers of two 1, 2, 4, …, 64 have 128 subset sums and no two are equal. So do 20, 31, 37, 40, 42, 43 and 44, whose largest member is smaller, and an exhaustive search shows no seven numbers do it with less. A pigeonhole on the sums says the largest member must grow like 2ⁿ/n; a variance argument improves that to 2ⁿ/√n; the best known sets sit near 0.22 × 2ⁿ. Whether the truth is a constant times 2ⁿ is Erdős's five-hundred-dollar question, and the pigeonhole cannot reach it.
Named alongside it
The objects these essays reach for when they reach for this one.
Exhaustive searchDensityDivisor sumOpen problemPerfect numberAbundanceAsymptoticsBinomial coefficientCounterexampleDivisibilityEgyptian fractionGoldbach