If n=p is a prime number, we have
f(p)=f(pp)−f(p)=f(1)−f(p)
i.e.
f(p)=2f(1)
If n=pq, where p and q are prime numbers, then
f(n)=f(pn)−f(p)=f(q)−f(p)=2f(1)−2f(1)=0
If n is a product of three prime numbers, we have
f(n)=f(pn)−f(p)=0−f(p)=−f(p)=−2f(1)
With mathematical induction by a number of prime multipliers we shall prove that: if n is a product of k prime numbers then
f(n)=(2−k)2f(1)
For k=1, clearly the statement (2) holds.
Let statement (2) hold for all integers n, where n is a product of k prime numbers.
Now let n be a product of k+1 prime numbers. Then we have n=n1p, where n1 is a product of k prime numbers.
So
f(n)=f(pn)−f(p)=f(n1)−f(p)=(2−k)2f(1)−2f(1)=(2−(k+1))2f(1)
So (2) holds for every integer n>1.
Now from f(22007)+f(32008)+f(52009)=2006 and because of (2) we have
2006=f(22007)+f(32008)+f(52009)=22−2007f(1)+22−2008f(1)+22−2009f(1)=−23⋅2006f(1)
i.e.
f(1)=−32
Since
2007=32⋅223,2008=23⋅251,2009=72⋅41
and because of (2) and (3), we get
f(20072)+f(20083)+f(20095)=22−6f(1)+22−12f(1)+22−15f(1)=−227f(1)=−227⋅(−32)=9