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.
A function is multiplicative if and whenever .
It is completely multiplicative if for all positive integers (not just coprime ones).
- Euler's totient: for prime
- Divisor sum: , with
- Number of divisors: , with
- MΓΆbius function: for all primes , for
The key insight is that multiplicative functions are completely determined by their values on prime powers. If is the prime factorization, then:
If and are multiplicative, then their Dirichlet convolution is also multiplicative. At prime powers:
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.
The totient function satisfies , meaning:
This can be verified by counting: each integer contributes to .
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.