Definition: A ratio defined as σ(n)/n, where σ(n) is the sum of the divisors of the integer n. It is used to classify numbers as deficient (I(n) < 2), perfect (I(n) = 2), or abundant (I(n) > 2).
Chapter 1: A Number's "Friendship Score" (Elementary School Understanding)
Imagine every number has "sharing buddies." A number's buddies are all the numbers that can be divided into it perfectly, except for the number itself.
Let's look at the number 6. Its sharing buddies are 1, 2, and 3.
Now, let's find its "Friendship Score" by adding up its buddies: 1 + 2 + 3 = 6.
Since the Friendship Score (6) is the same as the number (6), we call it a perfectly friendly number! It’s perfectly balanced.
Let's try the number 10. Its sharing buddies are 1, 2, and 5.
Its Friendship Score is 1 + 2 + 5 = 8.
Since the score (8) is less than the number (10), we say the number is a little lonely. It has a few good buddies, but not quite enough to be balanced.
Now for the number 12. Its sharing buddies are 1, 2, 3, 4, and 6.
Its Friendship Score is 1 + 2 + 3 + 4 + 6 = 16.
Since the score (16) is more than the number (12), we say the number is extra friendly! It has so many buddies that it’s overflowing with friendship.
The Abundancy Index is just a fancy name for this idea—it tells us if a number is lonely, perfectly friendly, or extra friendly.
Chapter 2: The Generosity Index (Middle School Understanding)
In mathematics, a number's divisors are all the integers that divide into it evenly. For the number 12, the divisors are {1, 2, 3, 4, 6, 12}.
The Abundancy Index is a way to measure a number's "generosity." We do this in two steps:
Sum the Divisors: We add up all the divisors, including the number itself. This sum is called sigma of n, or σ(n).
For 12: σ(12) = 1 + 2 + 3 + 4 + 6 + 12 = 28.
Form a Ratio: We divide this sum by the original number. This ratio is the Abundancy Index, I(n).
For 12: I(12) = 28 / 12 ≈ 2.33.
The key number for comparison is 2.
Deficient (I(n) < 2): The sum of divisors is less than twice the number. These numbers are "ungenerous."
Example: For 10, σ(10) = 1+2+5+10 = 18. The index is I(10) = 18/10 = 1.8, which is less than 2.
Perfect (I(n) = 2): The sum of divisors is exactly twice the number. These numbers are perfectly balanced.
Example: For 6, σ(6) = 1+2+3+6 = 12. The index is I(6) = 12/6 = 2.
Abundant (I(n) > 2): The sum of divisors is greater than twice the number. These numbers are "overly generous."
Example: For 12, I(12) = 28/12 ≈ 2.33, which is greater than 2.
This index gives us a precise mathematical language to describe the ancient ideas of deficient, perfect, and abundant numbers.
Chapter 3: A Multiplicative Function (High School Understanding)
The Abundancy Index, I(n), is formally defined as the ratio of the sum-of-divisors function, σ(n), to the number n itself. The function σ(n) is a multiplicative function, which means that if two numbers a and b are coprime (their greatest common divisor is 1), then σ(ab) = σ(a)σ(b). This property gives us a powerful way to calculate the index.
Calculating σ(n) from Prime Factorization:
If the prime factorization of a number is n = p₁^a₁ * p₂^a₂ * ... * pₖ^aₖ, then:
σ(n) = [ (p₁^(a₁+1) - 1) / (p₁ - 1) ] * [ (p₂^(a₂+1) - 1) / (p₂ - 1) ] * ...
Example: Calculate I(20)
Prime Factorization: 20 = 2² * 5¹
Calculate σ for each prime power:
σ(2²) = (2³ - 1) / (2 - 1) = 7 / 1 = 7
σ(5¹) = (5² - 1) / (5 - 1) = 24 / 4 = 6
Calculate σ(20): Since 2² and 5¹ are coprime, σ(20) = σ(2²) * σ(5¹) = 7 * 6 = 42.
Calculate the Abundancy Index: I(20) = σ(20) / 20 = 42 / 20 = 2.1.
Classification: Since 2.1 > 2, the number 20 is abundant.
This method allows us to classify any number, no matter how large, by analyzing its prime factors—its "algebraic soul." This index is crucial in the study of perfect numbers and is central to one of the oldest unsolved problems in mathematics: the search for an odd perfect number.
Chapter 4: Properties of the Index Function (College Level Understanding)
The Abundancy Index I(n) = σ(n)/n can be viewed as a function I: ℤ⁺ → ℚ, mapping the positive integers to the rational numbers. While seemingly simple, this function has remarkably deep and complex properties.
Multiplicativity: I(n) is a multiplicative function. If gcd(m, n) = 1, then I(mn) = I(m)I(n). This follows directly from the multiplicativity of σ(n).
Formula via Prime Factorization: The index can be expressed as a product over the prime factors of n:
I(n) = Π [ (pᵢ^(aᵢ+1) - 1) / (pᵢ - 1)pᵢ^aᵢ ] = Π [ (1 + pᵢ + ... + pᵢ^aᵢ) / pᵢ^aᵢ ]
Dense Range: The set of all possible values of I(n) is dense in the interval [1, ∞). This means that for any real number x ≥ 1, there exists an integer n whose Abundancy Index is arbitrarily close to x. This implies that numbers can be found with any "degree of generosity" you can imagine.
Superabundant and Colossally Abundant Numbers: These are classes of integers where the Abundancy Index is exceptionally large relative to the number's size.
A number n is superabundant if I(n) > I(m) for all m < n. They are the record-holders for abundance.
A number n is colossally abundant if for some ε > 0, the function σ(n) / n^(1+ε) is maximized at n. These are an even more restrictive class of numbers with deep connections to the Riemann Hypothesis.
Connection to the Riemann Hypothesis: The search for an upper bound on the growth of σ(n) is directly linked to the Riemann Hypothesis (RH). Robin's inequality states that RH is true if and only if σ(n) < e^γ * n * log(log(n)) for all n ≥ 5041. This is equivalent to bounding the Abundancy Index: I(n) < e^γ * log(log(n)). This connection elevates the Abundancy Index from a mere number-theoretic curiosity to an object of profound importance in analytic number theory.
Chapter 5: Worksheet - Exploring the Abundancy Index
Part 1: The Friendship Score (Elementary Level)
The number 8 has sharing buddies {1, 2, 4}. What is its Friendship Score? Is 8 lonely, perfectly friendly, or extra friendly?
The number 20 has sharing buddies {1, 2, 4, 5, 10}. What is its Friendship Score? Is 20 lonely, perfectly friendly, or extra friendly?
Part 2: Calculating the Index (Middle School Level)
Find all the divisors of 18. Calculate the sum σ(18) and the Abundancy Index I(18).
The number 28 is a perfect number. Find all its divisors and show that its Abundancy Index I(28) is exactly 2.
Is the number 30 deficient, perfect, or abundant? Show your work.
Part 3: Using Prime Factors (High School Level)
The prime factorization of 90 is 2 * 3² * 5. Use the multiplicative formula for σ(n) to calculate σ(90) and I(90).
Prove that all prime numbers must be deficient. (Hint: what are the only divisors of a prime number p?)
Prove that any power of a prime number (p^k) must be deficient.
Part 4: Advanced Properties (College Level)
If n is a perfect number, prove that the sum of the reciprocals of its divisors is equal to 2. (Hint: Start with the definition σ(n) = 2n).
A number n is called quasiperfect if σ(n) = 2n + 1. What would its Abundancy Index look like? Are these numbers abundant?
Research amicable numbers. How does their definition relate to the σ(n) function? Calculate I(220) and I(284) to see if they are abundant or deficient.4) to see if they are abundant or deficient.