ConceptComplete

Multiplicative Functions

Multiplicative functions exhibit remarkable structural properties that make them central objects in analytic number theory. Their behavior on prime powers determines them completely.

DefinitionMultiplicative and Completely Multiplicative

A function f:Nβ†’Cf: \mathbb{N} \to \mathbb{C} is multiplicative if f(1)=1f(1) = 1 and f(mn)=f(m)f(n)f(mn) = f(m)f(n) whenever gcd⁑(m,n)=1\gcd(m,n) = 1.

It is completely multiplicative if f(mn)=f(m)f(n)f(mn) = f(m)f(n) for all positive integers m,nm, n (not just coprime ones).

ExampleKey Multiplicative Functions
  • Euler's totient: Ο†(pk)=pkβˆ’1(pβˆ’1)\varphi(p^k) = p^{k-1}(p-1) for prime pp
  • Divisor sum: Οƒ(n)=βˆ‘d∣nd\sigma(n) = \sum_{d|n} d, with Οƒ(pk)=pk+1βˆ’1pβˆ’1\sigma(p^k) = \frac{p^{k+1}-1}{p-1}
  • Number of divisors: Ο„(n)=βˆ‘d∣n1\tau(n) = \sum_{d|n} 1, with Ο„(pk)=k+1\tau(p^k) = k+1
  • MΓΆbius function: ΞΌ(p)=βˆ’1\mu(p) = -1 for all primes pp, ΞΌ(pk)=0\mu(p^k) = 0 for kβ‰₯2k \geq 2

The key insight is that multiplicative functions are completely determined by their values on prime powers. If n=p1a1p2a2β‹―prarn = p_1^{a_1} p_2^{a_2} \cdots p_r^{a_r} is the prime factorization, then:

f(n)=f(p1a1)f(p2a2)β‹―f(prar)f(n) = f(p_1^{a_1}) f(p_2^{a_2}) \cdots f(p_r^{a_r})
DefinitionConvolution of Multiplicative Functions

If ff and gg are multiplicative, then their Dirichlet convolution h=fβˆ—gh = f * g is also multiplicative. At prime powers:

h(pk)=βˆ‘j=0kf(pj)g(pkβˆ’j)h(p^k) = \sum_{j=0}^{k} f(p^j) g(p^{k-j})
Remark

The convolution formula for multiplicative functions reduces computation from summing over all divisors to summing over prime power divisors. This is computationally advantageous and theoretically illuminating.

ExampleEuler's Totient via Convolution

The totient function satisfies Ο†βˆ—1=id\varphi * 1 = \text{id}, meaning:

βˆ‘d∣nΟ†(d)=n\sum_{d|n} \varphi(d) = n

This can be verified by counting: each integer 1≀k≀n1 \leq k \leq n contributes 11 to Ο†(gcd⁑(k,n))\varphi(\gcd(k,n)).

Understanding multiplicativity provides both computational tools (reducing calculations to prime powers) and theoretical insights (algebraic structure under convolution). Many deep results in number theory rely on analyzing multiplicative functions through their Dirichlet series and exploiting their algebraic properties.