Number theory is full of functions that take an integer and return something arithmetic about it: how many divisors it has, the sum of those divisors, how many numbers below it are coprime. A startling number of these share one magic property — they break apart along the prime factorisation. Such functions are called multiplicative.

Definition

An arithmetic function f (defined on positive integers) is multiplicative if f(1) = 1 and

The coprime condition is essential — it need not hold for numbers sharing a factor. (If it holds for all m, n, the function is called completely multiplicative.) We have already met one: Euler's totient \varphi.

Why it's so powerful

A multiplicative function is completely determined by its values on prime powers. Given the factorisation n = p_1^{a_1}\cdots p_k^{a_k}, the coprime pieces p_i^{a_i} multiply out:

So to understand f everywhere you only need to understand it on prime powers — turning hard global questions into easy local ones. This is the recurring engine of the whole stage.

A worked split

Suppose f is multiplicative with f(2^a) = a + 1 and f(3^b) = b + 1. Then since 12 = 2^2 \cdot 3:

That particular f is the divisor-counting function — our first concrete example, next.