Arithmetic Functions

Key Functions

PropertyStatement
τ(n)Number of divisors
σ(n)Sum of divisors
μ(n)Möbius function
φ(n)Euler totient

Examples

Example 1. τ(12) and σ(12).

Solution. Divisors: 1,2,3,4,6,12. τ=6, σ=28.

In Depth

An arithmetic function maps positive integers to complex numbers. Key examples: \(d(n)\) (number of divisors), \(\sigma(n)\) (sum of divisors), \(\phi(n)\) (Euler's totient), \(\mu(n)\) (Möbius function), \(\Lambda(n)\) (von Mangoldt function). These encode deep properties of the integers.

Multiplicative functions satisfy \(f(mn)=f(m)f(n)\) when \(\gcd(m,n)=1\). Completely multiplicative functions satisfy this for all \(m,n\). The Dirichlet series \(\sum_{n=1}^\infty f(n)/n^s\) encodes a multiplicative function as an Euler product \(\prod_p(1+f(p)/p^s+f(p^2)/p^{2s}+\cdots)\).

Dirichlet convolution: \((f*g)(n)=\sum_{d\mid n}f(d)g(n/d)\). Arithmetic functions form a ring under pointwise addition and Dirichlet convolution. The identity element is \(\epsilon(n)=[n=1]\). The Möbius function is the inverse of the constant function 1: \(\mu*1=\epsilon\).

Möbius inversion: if \(g(n)=\sum_{d\mid n}f(d)\), then \(f(n)=\sum_{d\mid n}\mu(n/d)g(d)\). This is used to invert summatory formulas — for example, recovering \(\phi\) from the identity \(\sum_{d\mid n}\phi(d)=n\).

The Riemann zeta function \(\zeta(s)=\sum_{n=1}^\infty n^{-s}=\prod_p(1-p^{-s})^{-1}\) is the Dirichlet series of the constant function 1. The distribution of its zeros controls the error term in the prime number theorem, connecting arithmetic functions to complex analysis.

Key Properties & Applications

The Ramanujan sum \(c_q(n)=\sum_{\gcd(k,q)=1}e^{2\pi ikn/q}\) is a multiplicative arithmetic function that appears in the Fourier analysis of arithmetic functions. It satisfies \(c_q(n)=\mu(q/\gcd(n,q))\phi(q)/\phi(q/\gcd(n,q))\).

Selberg's formula \(\sum_{p\leq x}(\ln p)^2+\sum_{pq\leq x}\ln p\ln q=2x\ln x+O(x)\) is the starting point for the elementary proof of the prime number theorem. It shows that primes are 'almost' uniformly distributed without using complex analysis.

The Dirichlet hyperbola method computes \(\sum_{n\leq x}(f*g)(n)\) efficiently by splitting the sum at \(\sqrt{x}\). Applied to \(d=1*1\), it gives \(\sum_{n\leq x}d(n)=x\ln x+(2\gamma-1)x+O(\sqrt{x})\) — the Dirichlet divisor problem.

Further Reading & Context

The study of arithmetic functions connects to many areas of mathematics and its applications. Understanding the foundational definitions and theorems provides the basis for advanced work in analysis, algebra, and applied mathematics.

Historical development: most mathematical concepts evolved over centuries, with contributions from mathematicians across many cultures. The modern axiomatic treatment provides rigor, while computational tools enable practical application.

In modern mathematics, this topic appears in graduate courses and research across pure and applied mathematics. Connections to computer science, physics, and engineering make it a versatile and important area of study. Mastery of the core results and techniques opens doors to research in number theory, analysis, geometry, and beyond.

Recommended next steps: work through the standard theorems with full proofs, explore the connections to related topics listed above, and practice with a variety of problems ranging from computational exercises to theoretical proofs. The interplay between different areas of mathematics is one of the subject's greatest rewards.

Deep Dive: Arithmetic Functions

This lesson extends core ideas for arithmetic functions with rigorous reasoning, edge-case checks, and application framing in number theory.

Practice Set

Practice. Derive one main result on this page and validate with a numeric or geometric check.

Goal. Confirm assumptions, transformation steps, and final interpretation.

References & Editorial Notes

  • Stewart, Calculus.
  • Strang, Introduction to Linear Algebra.
  • Apostol, Mathematical Analysis.

Last editorial review: 2026-04-14.