Linked from

The 11 pages that link to Divisor function, each with the reason it gives.

• Riemann zeta functionBroader topic: The Dirichlet series for dₖ(n) is ζ(s)ᵏ, connecting its poles to divisor-counting estimates.

• Fundamental theorem of arithmeticRelated: A number's prime exponents determine its number and sum of positive divisors.

• Euler's totient functionRelated: The identity ∑_{d|n} φ(d) = n connects totients to divisor sums.

• Multiplicative functionBroader topic: Its divisor sum factors across coprime inputs; σ_0 counts divisors.

• Möbius functionRelated: The Möbius function's divisor sums produce identities used in inversion.

• Perfect numberRelated: A number is perfect exactly when its divisor sum is twice the number.

• Arithmetic functionBroader topic: It packages the number and sizes of an integer’s divisors into one value.

• Euclid–Euler theoremRelated: The sum-of-divisors function verifies that each number in the theorem's formula is perfect.

• Aliquot sequenceNarrower topic: The aliquot rule is built from a standard divisor-based function.

• Highly composite numberRelated: Highly composite numbers are precisely the integers that establish successive records for this function.

• Aliquot sumRelated: The sum-of-divisors function gives the aliquot sum after subtracting the integer.