I am going to show a proof of
We start off by writing this as
Let this be; we will use this later.
Lemma: where F(n) is a completely additive function.
Proof: we can split the sum over primes. . we use this and get
Now is a completely additive function, so
We know that and putting in the RHS's summation in terms of Von Mangoldt: