composition of multiplicative functions
Theorem.
If is a completely multiplicative function and is a multiplicative function, then is a multiplicative function.
Proof.
First note that since both and are multiplicative.
Let and be relatively prime positive integers. Then
∎
Note that the assumption that is completely multiplicative (as opposed to merely multiplicative) is essential in proving that is multiplicative. For instance, , where denotes the divisor function
, is not multiplicative: