criterion for a multiplicative function to be completely multiplicative
Theorem.
Let be a multiplicative function with convolution inverse . Then is completely multiplicative if and only if for all primes and for all with .
Proof.
Note first that, since and , where denotes the convolution identity function, then . Let be any prime. Then
Thus, .
Assume that is completely multiplicative. The statement about will be proven by induction on . Note that:
Let with such that, for all with , . Then:
Conversely, assume that for all with . The statement will be proven by induction on . The statement is obvious for . Let such that . Then:
Thus, . It follows that is completely multiplicative.∎