Thursday, 18 October 2018

mobius inversion - Sum over divisors of gcd of two numbers

How can I calculate this sum?




d | (n1,n2)μ(d)τ(n1d)τ(n2d),



where (n1,n2) is gcd of n1 and n2, μ is Mobius function and τ(n) is the number of positive divisors of n.



I tried to use Mobius inversion formula, but still can't manage to deal with the problem.



Any ideas? Thanks.



P.S. Note that sum in the above equation runs over positive divisors only.

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...