The divisor summatory function is commonly denoted by D(x) and is defined as the sum of the divisor-counting function τ(n) over all positive integers n not exceeding x. Since τ(n) counts the positive divisors of n, the summatory function counts the total number of ordered pairs (a,b) of positive integers satisfying ab ≤ x. For example, when x = 5, the divisor counts are τ(1) = 1, τ(2) = 2, τ(3) = 2, τ(4) = 3, and τ(5) = 2. Therefore, D(5) = 10. The function is also connected with counting lattice points below a hyperbola. Its average growth is approximately x ln(x) plus a constant multiple of x. More precise analysis studies the error term between the actual value and its main asymptotic expression.
Divisor Summatory Function
The divisor summatory function measures the total number of positive divisors contributed by all positive integers up to a given bound.
D(x) = Σₙ≤ₓ τ(n) = Σₐᵦ≤ₓ 1 = x ln(x) + (2γ − 1)x + O(√x), where γ is the Euler–Mascheroni constant.
Explanation
Variables
D(x): Divisor summatory function
τ(n): Number of positive divisors of n
x: Upper bound
a and b: Positive integers satisfying ab ≤ x
γ: Euler–Mascheroni constant
O(√x): Error-term bound
Example or application
A worked example has not yet been added.
Definition
The divisor summatory function is D(x) = Σₙ≤ₓ τ(n), where τ(n) is the number of positive divisors of n.
Purpose
It counts the total number of divisors across all positive integers up to a given bound and helps study the average behaviour of the divisor-counting function.
Importance
The divisor summatory function is an important object in analytical number theory. It connects divisor counting with asymptotic estimates, lattice-point problems, and the classical Dirichlet divisor problem.
Key Concepts
Divisor-counting function
Summatory function
Divisor pairs
Hyperbola method
Asymptotic estimate
Error term
Characteristics
It is a non-decreasing integer-valued function.
It sums the divisor counts of all positive integers up to x.
It can be interpreted as counting positive integer pairs whose product does not exceed x.
Its leading growth term is approximately x ln(x).
Its precise behaviour involves an error term.
It is closely connected with the Dirichlet divisor problem.
Types
Exact divisor summatory function
Asymptotic divisor summatory estimate
Weighted divisor summatory functions
Components
Divisor-counting function τ(n)
Positive integer variable n
Upper bound x
Summation operation
Main asymptotic term
Error term
Properties
D(x) = D(⌊x⌋) for real x ≥ 1.
D(x) increases whenever x passes a positive integer.
D(x) counts all positive integer pairs (a,b) satisfying ab ≤ x.
The leading asymptotic term is x ln(x).
The classical error term is connected with the Dirichlet divisor problem.
The summatory function is built from the values of τ(n).
Examples
τ(1) = 1, τ(2) = 2, τ(3) = 2, τ(4) = 3, and τ(5) = 2.
D(5) = 1 + 2 + 2 + 3 + 2 = 10.
D(3) = τ(1) + τ(2) + τ(3) = 5.
The integer pairs counted by D(3) are (1,1), (1,2), (2,1), (1,3), and (3,1).
Applications
Divisor-counting problems
Analytical number theory
Lattice-point counting
Studying average divisor behaviour
Investigating the Dirichlet divisor problem
Estimating summatory arithmetic functions
Prerequisites
Positive integers
Divisors and multiples
Divisor-counting function
Summation notation
Natural logarithms
Asymptotic notation
Learning Objectives
Define the divisor summatory function.
Calculate D(x) for small integer values.
Explain its connection with divisor pairs.
Interpret its main asymptotic term.
Understand the role of the error term in divisor problems.
Common Mistakes
Confusing D(x) with τ(x).
Counting only the divisors of x instead of summing divisor counts up to x.
Forgetting that ordered pairs (a,b) and (b,a) are counted separately.
Treating the asymptotic expression as an exact equality.
Ignoring the role of the error term.
Practice Questions
Calculate τ(n) for n = 1, 2, 3, 4, and 6.
Find D(4).
Explain why D(x) counts integer pairs satisfying ab ≤ x.
What is the leading term in the asymptotic estimate of D(x)?
What mathematical problem studies the error term in the divisor summatory function?
Key Takeaway
The divisor summatory function adds the divisor counts of all positive integers up to x and connects divisor arithmetic with asymptotic analysis and lattice-point counting.
Related Topics
Divisor-Counting Function
Arithmetic Functions
Dirichlet Divisor Problem
Hyperbola Method
Asymptotic Analysis
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