[莫比乌斯反演]求n,m公约数为k的个数技巧

若有形如$f(k)=\sum _{i=1}^n\sum _{j=1}^m[gcd(i,j)=k]$

那么它的倍数和$F(k)=\sum _{k|d}f(d)$

把$f(k)=\sum _{i=1}^n\sum _{j=1}^m[gcd(i,j)=k]$代入$F(k)=\sum _{k|d}f(d)$

得到$F(k)=\sum _{k|d}\sum _{i=1}^n\sum _{j=1}^m[gcd(i,j)=d]$

改变一下枚举顺序 ∑ k ∣ d ∑ i = 1 n ∑ j = 1 m [ g c d ( i , j ) = d ] = ∑ i = 1 n ∑ j = 1 m ∑ k ∣ d [ g c d ( i , j ) = d ] \sum\limits_{k|d}\sum\limits_{i=1}^{n}\sum\limits_{j=1}^{m}[gcd(i,j)=d]=\sum\limits_{i=1}^{n}\sum\limits_{j=1}^{m}\