Divisor Function¶
The multiplicative arithmetic-function family \(\sigma_z(n)=\sum_{d\mid n}d^z\), including divisor count and divisor sum as distinguished cases.
Core Idea¶
The divisor functions are the arithmetic-function family
where \(n\) is a positive integer, the sum ranges over its positive divisors, and \(z\) is real or complex. NIST's Digital Library of Mathematical Functions uses this definition and identifies \(\sigma_0(n)\) with the divisor-counting function and \(\sigma_1(n)\) with the sum of divisors. When the phrase “the divisor function” appears without a parameter, it often means \(d(n)=\tau(n)=\sigma_0(n)\); notation must therefore be declared.
Scope of Application¶
In elementary number theory, \(\tau(n)\) counts factors, \(\sigma_1(n)\) classifies perfect, deficient, and abundant numbers through comparison with \(2n\), and \(s(n)\) generates aliquot sequences. In multiplicative number theory, the prime-power product supplies exact evaluation and Euler products. In analytic number theory, summatory behavior leads to the Dirichlet divisor problem; DLMF records
Clarity¶
The parameterized notation resolves recurring ambiguity. “Number of divisors” is \(\sigma_0\), “sum of divisors” is \(\sigma_1\), and “sum of reciprocal divisors” is \(\sigma_{-1}\). Writing \(\sigma_z\) prevents a proof about one specialization from being silently applied to another.
Prime factorization also clarifies mechanism. The value is not mysterious global behavior: every divisor chooses an exponent \(0\le j_i\le a_i\) independently at each prime.
Manages Complexity¶
Naively, evaluating \(\sigma_z(n)\) suggests scanning integers up to \(n\). Once the factorization \(n=\prod p_i^{a_i}\) is known, the product formula reduces evaluation to \(\sum_i(a_i+1)\)-scale local terms rather than enumerating all candidates. The compression is structural: a divisor corresponds bijectively to one choice of exponent at each prime.
Abstract Reasoning¶
Multiplicativity: when \(\gcd(m,n)=1\), every divisor of \(mn\) factors uniquely as \(ab\) with \(a\mid m,b\mid n\), so \((ab)^z=a^zb^z\) and the double sum factors. Prime-power evaluation: divisors of \(p^a\) are exactly \(1,p,\ldots,p^a\). Dirichlet convolution: if \(\operatorname{id}_z(n)=n^z\), then \(\sigma_z=\mathbf1*\operatorname{id}_z\), explaining the product of zeta functions in the Dirichlet series.
Knowledge Transfer¶
Within number theory, the full mechanism transfers literally among exact computation, multiplicative-function proofs, Euler products, average orders, perfect-number questions, and modular forms. The prime-local factorization and divisor aggregation remain unchanged.
Outside this domain, Aggregation and factorwise decomposition are portable parent structures, but the named divisor function is not. In algebraic number theory, analogous ideal-divisor sums are genuine extensions with different objects and norms; in data analysis, “divisor function” has no general transferable meaning.
Relationships to Other Abstractions¶
Current abstraction Divisor Function Domain-specific
Parents (1) — more general patterns this builds on
-
Divisor Function presupposes Aggregation Prime
Divisor Function presupposes
prime:aggregation: each value collapses a complete weighted divisor set to one number.
Hierarchy path (1) — routes to 1 parentless root
- Divisor Function → Aggregation → Micro Macro Linkage
Neighborhood in Abstraction Space¶
Divisor Function sits in a sparse region of the domain-specific corpus (69th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Computational Number Theory & Enumeration (13 abstractions)
Nearest neighbors
- Giuga Number — 0.86
- Primefree Sequence — 0.85
- Hyperperfect number — 0.84
- Polynomial Ring — 0.84
- Carlyle Circle — 0.84
Computed from structural-signature embeddings · 2026-09-08