Concept

Subset-sum

The problem of deciding whether some selection from a list of numbers adds up exactly to a given target. It is hard in general, and the best known methods split the list and look for a collision between the halves' sums.

Named by 3 essays across 2 fields — each of them below, with the objects they name alongside it.

Named alongside it

The objects these essays reach for when they reach for this one.

Exhaustive searchDensityDivisor sumOpen problemPerfect numberAbundanceAsymptoticsBinomial coefficientCounterexampleDivisibilityEgyptian fractionGoldbach

All concepts