Theorem 1
The Dirichlet inverse of a completely multiplicative functionis given by the formula
for all
Proof: LetIf
is completely multiplicative then
sinceand
for
hence
Conversely supposeTo show that
is completely multiplicative it suffices to prove that
for all primes
and integers
The equation
implies
for
Hence takingwe have
from which
so
is completely multiplicative.
Example
Euler's totient function so
but
since
is completely multiplicative so
so
Theorem 2
Ifis multiplicative
Proof: Letthen
is multiplicative so to determine
it suffices to find
Hence