第二类莫比乌斯反演

---

$求满足x ∈ [1,n], y ∈ [1,m] 且gcd(x,y) = 1的x,y的对数$
$即求\sum_{i=1}^n \sum_{j=1}^m[gcd(i,j)=1]$

$令f(x) = \sum_{i=1}^n \sum_{j=1}^m[gcd(i,j)=x]$

$g(x) = \sum_{i=1}^n \sum_{j=1}^m[x | gcd(i,j)] = [{n\over x}][{m\over x}]$

$那么g(x) = \sum_{x|d} f(d)$

$反演得：f(x) = \sum_{x|d}g(d)\ \mu({d \over x})$

$所以f(1) = \sum_{d}g(d)\ \mu({d}) = \sum_{d} g(d)\ \mu(d) = \sum_{d}\mu(d)\ [{n\over d}][{m\over d}]$

$Q.E.D$