The sum-of-divisors function, usually written as σ(n), adds all positive divisors of a positive integer n. For example, the positive divisors of 12 are 1, 2, 3, 4, 6, and 12, so σ(12) = 28. If the prime factorization of n is known, the divisor sum can be calculated using a product of geometric sums. A number-theoretic function f is multiplicative if f(1) = 1 and f(ab) = f(a)f(b) whenever a and b are relatively prime. The divisor-counting function τ(n) and the sum-of-divisors function σ(n) are both multiplicative. However, multiplicativity does not generally mean that f(ab) = f(a)f(b) for all integers a and b; the relatively prime condition matters. These functions are important for understanding perfect, abundant, deficient, and other special integers.
Sum of Divisors and Multiplicative Functions
The sum-of-divisors function calculates the sum of all positive divisors of an integer, while multiplicative functions preserve multiplication for relatively prime inputs.
If n = p₁^a₁ × ... × pₖ^aₖ, then σ(n) = [(p₁^(a₁+1) - 1)/(p₁ - 1)] × ... × [(pₖ^(aₖ+1) - 1)/(pₖ - 1)].
Explanation
Variables
Σ(n)
The sum of all positive divisors of n.
N
The positive integer being studied.
P₁, p₂, ..., pₖ
Distinct prime factors of n.
A₁, a₂, ..., aₖ
Their corresponding positive integer exponents.
Gcd(a, b)
The greatest common divisor of a and b.
Example or application
A worked example has not yet been added.
Definition
The sum-of-divisors function σ(n) gives the sum of all positive divisors of n. A multiplicative function is an arithmetic function f satisfying f(1) = 1 and f(ab) = f(a)f(b) whenever gcd(a, b) = 1.
Purpose
To calculate divisor sums and understand arithmetic functions that describe how number-theoretic properties behave under multiplication.
Importance
The sum-of-divisors function and multiplicative functions are essential tools in analytic and elementary number theory, especially in the study of perfect numbers and divisor relationships.
Key Concepts
Sum-of-divisors function
Proper-divisor sum
Prime-power divisors
Geometric series
Multiplicative functions
Relatively prime integers
Greatest common divisor
Characteristics
σ(n) includes the number itself among its divisors.
The proper-divisor sum is σ(n) - n.
For a prime power pᵃ, the divisor sum is a geometric series.
The sum-of-divisors function is multiplicative.
The divisor-counting function is also multiplicative.
Multiplicativity requires the input integers to be relatively prime.
The sum-of-divisors function is not completely multiplicative.
Types
| Name | Description |
|---|---|
Multiplicative functions | Arithmetic functions satisfying f(ab) = f(a)f(b) for relatively prime a and b. |
Completely multiplicative functions | Functions satisfying f(ab) = f(a)f(b) for all positive integers a and b. |
Sum-of-divisors function | The function σ(n), which adds all positive divisors of n. |
Proper-divisor sum function | The function s(n) = σ(n) - n. |
Components
Positive integer
Prime factorization
Positive divisors
Geometric sums
Arithmetic function
Greatest common divisor
Properties
σ(1) = 1.
For a prime p, σ(p) = p + 1.
For a prime power pᵃ, σ(pᵃ) = 1 + p + p² + ... + pᵃ.
The sum-of-divisors function is multiplicative.
If gcd(a, b) = 1, then σ(ab) = σ(a)σ(b).
The proper-divisor sum is s(n) = σ(n) - n.
A positive integer n is perfect if σ(n) = 2n.
Examples
| Problem | Solution |
|---|---|
Find σ(12). | The positive divisors of 12 are 1, 2, 3, 4, 6, and 12. Therefore, σ(12) = 1 + 2 + 3 + 4 + 6 + 12 = 28. |
Calculate σ(8) using prime factorization. | Since 8 = 2³, σ(8) = (2⁴ - 1)/(2 - 1) = 15. The positive divisors are 1, 2, 4, and 8. |
Calculate σ(15) using multiplicativity. | Since 15 = 3 × 5 and gcd(3, 5) = 1, σ(15) = σ(3)σ(5) = (1 + 3)(1 + 5) = 4 × 6 = 24. |
Find the proper-divisor sum of 12. | Since σ(12) = 28, the proper-divisor sum is s(12) = 28 - 12 = 16. |
Applications
Perfect-number identification
Abundant and deficient number classification
Amicable-number research
Arithmetic function analysis
Number theory algorithms
Prime factorization studies
Prerequisites
Prime factorization
Positive divisors
Geometric series
Greatest common divisor
Multiplication and exponents
Learning Objectives
Define the sum-of-divisors function.
Calculate σ(n) by listing divisors.
Calculate σ(n) using prime factorization.
Understand the geometric-series formula.
Define multiplicative functions.
Explain why the relatively prime condition is necessary.
Connect divisor sums with perfect, abundant, and deficient numbers.
Common Mistakes
Excluding the number itself from σ(n).
Confusing σ(n) with the proper-divisor sum s(n).
Applying multiplicativity when the inputs are not relatively prime.
Forgetting the geometric-series exponent a + 1.
Assuming every multiplicative function is completely multiplicative.
Using the divisor-counting formula when calculating a divisor sum.
Practice Questions
Calculate σ(10).
Find the sum of all positive divisors of 24.
Calculate σ(16) using the prime-power formula.
What is the difference between σ(n) and s(n)?
Define a multiplicative arithmetic function.
Why is gcd(a, b) = 1 required for the multiplicative property?
Show that σ(15) = σ(3)σ(5).
Use σ(n) to determine whether 28 is a perfect number.
Key Takeaway
The sum-of-divisors function measures the total of an integer's positive divisors, while multiplicative functions reveal how arithmetic properties behave across relatively prime numbers.
Related Topics
Divisor Functions
Number of Divisors
Perfect Numbers
Abundant and Deficient Numbers
Amicable Numbers
Multiplicative Number Theory
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.
Suggest a correction or source · More in Arithmetic & Number Theory