先前在Wikipedia上看到了關於複值函數的Mobius inversion formula公式,但是上面並沒有放上證明,也找不到引用的是哪本書籍,以下為其中內容:
內容:
[Generalizations]
A related inversion formula more useful in combinatorics is as follows: suppose F(x) and G(x) are complex-valued functions defined on the interval [1,∞) such that
G(x)=summation(1<=n<=x){F(x/n)} for all x>=1
then
F(x)=summation(1<=n<=x){μ(n)*G(x/n)} for all x>=1 μ(n) is Mobius μ function