Definition: A number for which the sum of its proper divisors is less than the number itself (σ(n) < 2n).
Chapter 1: The "Lonely" Number (Elementary School Understanding)
Let's go back to our game of "Friendship Score," where we add up a number's "sharing buddies" (all its divisors except for itself).
We saw that 6 is a "perfectly friendly" number because its buddies (1+2+3) add up to 6.
We saw that 12 is an "extra friendly" (abundant) number because its buddies (1+2+3+4+6) add up to 16, which is more than 12.
Now, let's look at the number 10.
Its sharing buddies are 1, 2, and 5.
Let's find its Friendship Score: 1 + 2 + 5 = 8.
The score (8) is less than the number itself (10). It's like a friend who doesn't have quite enough friendship to share to be perfectly balanced. Because its score is "deficient" or lacking, we call it a deficient number.
Most numbers are a little bit "lonely" like this. All prime numbers are very lonely, because their only sharing buddy is the number 1!
Chapter 2: Less Than Balanced (Middle School Understanding)
A deficient number is an integer n where the sum of its proper divisors is less than n. The "sum of proper divisors" function is s(n).
Condition: s(n) < n.
This is the opposite of an abundant number.
Example: Is 16 a deficient number?
Find the proper divisors of 16: These are all the numbers that divide 16, except for 16 itself. They are {1, 2, 4, 8}.
Sum the proper divisors: s(16) = 1 + 2 + 4 + 8 = 15.
Compare: 15 < 16.
Verdict: Yes, 16 is a deficient number.
Using the Abundancy Index (I(n) = σ(n)/n):
An equivalent way to define a deficient number is that its Abundancy Index is less than 2.
I(n) < 2
This is because σ(n) is the sum of all divisors, so σ(n) = s(n) + n.
The condition s(n) < n is the same as s(n) + n < n + n, which is σ(n) < 2n. Dividing by n gives σ(n)/n < 2.
Example with I(n):
For n=16, σ(16) = 1+2+4+8+16 = 31.
I(16) = 31 / 16 ≈ 1.9375.
Since 1.9375 < 2, 16 is confirmed to be deficient.
All prime numbers and all powers of prime numbers are deficient.
Chapter 3: The Scarcity of Factors (High School Understanding)
A number n is deficient if σ(n) < 2n. The property of being deficient is a direct consequence of a number's Algebraic Soul (its prime factorization). Numbers are typically deficient if their prime factors are either large or are not raised to high powers.
Theorem 1: All prime numbers are deficient.
Proof: Let p be a prime number. Its only divisors are 1 and p.
σ(p) = 1 + p.
The condition for deficiency is 1 + p < 2p.
Subtracting p from both sides gives 1 < p. This is true for all prime numbers p.
Theorem 2: All powers of prime numbers are deficient.
Proof: Let n = p^k. We need to show I(p^k) < 2.
I(p^k) = σ(p^k)/p^k = (1 + p + ... + p^k) / p^k = 1/p^k + 1/p^(k-1) + ... + 1.
This is a finite geometric series. Its sum is strictly less than the sum of the infinite series, which converges to 1 / (1 - 1/p) = p/(p-1).
For the smallest prime p=2, the limit is 2/(2-1) = 2. Since our sum is strictly less than the limit, I(2^k) < 2.
For any odd prime p ≥ 3, the limit is p/(p-1) ≤ 3/2 < 2.
Therefore, any power of any prime is always deficient.
This proves that an enormous class of integers is guaranteed to be deficient.
Chapter 4: The Most Common Class of Numbers (College Level)
The set of deficient numbers is the most populous of the three classical categories (deficient, perfect, abundant).
Natural Density:
The natural density of a set of integers is the proportion of numbers that belong to that set.
The density of perfect numbers is 0 (they are extremely rare).
The density of abundant numbers has been proven to be a value between 0.2474 and 0.2480.
Therefore, the density of deficient numbers is the remainder, which is approximately 0.7525.
Roughly 3 out of every 4 integers are deficient.
Untouchable Numbers:
A related concept is that of untouchable numbers. An integer k is untouchable if there is no solution to the equation σ(n) - n = k. It is a number that can never be the sum of the proper divisors of any other number.
5 is an untouchable number. You can never find an n where s(n) = 5.
It is proven that all untouchable numbers are deficient (since s(n) cannot be n or greater than n if it doesn't exist).
It is conjectured that 5 is the only odd untouchable number.
Role in the Odd Perfect Number Problem:
The concept of deficiency is central to the Law of Abundance Conflict. The proof of that law hinges on the fact that the "special core" of an OPN, pᵏ, is always deficient. This requires the "square" part, m², to be abundant in a very specific way to compensate for this deficiency. The conflict arises because the deficiency of pᵏ is too great for any known structure of an abundant m² to perfectly balance.
Chapter 5: Worksheet - Lacking in Sum
Part 1: The "Lonely" Number (Elementary Level)
The number 9 has "sharing buddies" {1, 3}. What is its Friendship Score?
Is 9 a lonely (deficient), perfectly friendly (perfect), or extra friendly (abundant) number?
Part 2: Less Than Balanced (Middle School Understanding)
Using the sum of proper divisors s(n), determine if n=26 is deficient.
Using the Abundancy Index I(n), determine if n=30 is deficient.
Are all odd numbers deficient? (Hint: test the odd abundant number 945).
Part 3: Scarcity of Factors (High School Understanding)
Prove that n=49 = 7² is a deficient number using the Abundancy Index formula for prime powers.
The number 17 is prime. What is σ(17)? Show that it is deficient.
Part 4: Density and Theory (College Level)
What is the approximate natural density of deficient numbers? What does this tell you about how common they are?
What is an untouchable number?
How does the fact that pᵏ (the special core of a hypothetical OPN) is always deficient create a fundamental challenge in the search for an OPN?