Students and mathematicians studying number theory or abstract algebra who need to understand multiplicative functions.
An arithmetic function has positive integers as its domain and a ring (often reals or integers) as its codomain.
A function is completely multiplicative if f(nm) = f(n)f(m) for all positive integers n and m.
n^alpha and n^2 are completely multiplicative. The proof involves showing the function distributes over products.
A function is multiplicative if f(nm) = f(n)f(m) only when n and m are relatively prime.
f(n)=1 is completely multiplicative. f(1)=1 and f(n)=0 for n>1 is also completely multiplicative.
The constant function f(n)=2 is not multiplicative because f(2*3) != f(2)*f(3).
If f is multiplicative and not constantly zero, then f(1) must equal 1.