A positive integer whose sum of proper positive divisors is less than the integer itself.

Principle

Characterized by s(n) < n where s(n) denotes the sum of proper divisors; indicates a numerical deficit of divisorial contribution relative to the integer.

Demonstration

Example: 8 has proper divisors 1, 2, 4 which sum to 7, so 8 is deficient. Every prime number p is deficient because its only proper divisor is 1, so s(p) = 1 < p.

Misapplication

Counting the number among its proper divisors and thereby misclassifying perfect numbers as deficient, or assuming deficiency implies primality (composite numbers can be deficient as well).

Consequence

Recognizing deficient numbers helps describe density and distribution of integers by divisor-sum classes and informs multiplicative structure studies; many small integers are deficient, which affects heuristics about random integers.

Reversal

The inverse is abundance (s(n) > n); perfect numbers sit exactly between the two classes. Reversal highlights how divisorial resources compare across integers.

Boundary

Applies to positive integers and uses proper divisors only; excludes perfect and abundant numbers. Zero or negative integers are outside the standard domain for this classification.

Semantic Tension

Tension arises with concepts like primitively abundant or almost perfect numbers; one may conflate low s(n) values with other structural properties like primality or scarcity of small prime factors.

Synthesis

A deficient number is a positive integer whose proper divisors fail to sum to the number, indicating a shortfall in divisor mass and placing the integer on the deficit side of the divisor-sum taxonomy.