Theorem 1
The Dirichlet inverse of a completely multiplicative function
is given by the formula
for all![]()
Proof: Let
If
is completely multiplicative then![]()
since
and
for
hence![]()
Conversely suppose
To show that
is completely multiplicative it suffices to prove that
for all primes
and integers
The equation
implies
for![]()
Hence taking
we have
from which
so
is completely multiplicative.
Example
Euler's totient function
so
but
since
is completely multiplicative so
so![]()
Theorem 2
If
is multiplicative![]()
Proof: Let
then
is multiplicative so to determine
it suffices to find![]()
![]()
Hence![]()