题目大意
求 ∑ i = 1 a ∑ j = 1 b ∑ k = 1 c [ g c d ( i , j , k ) = 1 ] \sum\limits_{i=1}^{a}\sum\limits_{j=1}^{b}\sum\limits_{k=1}^{c}[gcd(i,j,k)=1] i=1∑aj=1∑bk=1∑c[gcd(i,j,k)=1]
详细思路
先推导这两个式子 ∑ i = 1 n [ g c d ( i , m ) = 1 ] \sum\limits_{i=1}^{n}[gcd(i,m)=1] i=1∑n[gcd(i,m)=1], ∑ i = 1 n ∑ j = 1 m [ g c d ( i , j ) = k ] \sum\limits_{i=1}^{n}\sum\limits_{j=1}^{m}[gcd(i,j)=k] i=1∑nj=1∑m[gcd(i,j)=k]
关于 ∑ i = 1 n [ g c d ( i , m ) = 1 ] \sum\limits_{i=1}^{n}[gcd(i,m)=1] i=1∑n[gcd(i,m)=1]
可以感性思考一下,我们可以通过把 1 1 1到 n n n中,把所有关于 m m m的质因数的倍数减去,把减多的加回来,再把加多的减回去……
进行了一次容斥操作,可以通过 μ \mu μ实现
∑ i = 1 n [ g c d ( i , m ) = 1 ] = ∑ d ∣ m μ ( d ) ⌊ n d ⌋ \sum\limits_{i=1}^{n}[gcd(i,m)=1]=\sum\limits_{d|m}\mu(d)\lfloor \frac{n}{d}\rfloor i=1∑n[gcd(i,m)=1]=d∣m∑μ(d)⌊dn⌋
关于 ∑ i = 1 n ∑ j = 1 m [ g c d ( i , j ) = k ] \sum\limits_{i=1}^{n}\sum\limits_{j=1}^{m}[gcd(i,j)=k] i=1∑nj=1∑m[gcd(i,j)=k]
设 f ( k ) = ∑ i = 1 n ∑ j = 1 m [ g c d ( i , j ) = k ] f(k)=\sum\limits_{i=1}^{n}\sum\limits_{j=1}^{m}[gcd(i,j)=k] f(k)=i=1∑nj=1∑m[gcd(i,j)=k]
那么它的倍数和 F ( k ) = ∑ k ∣ d f ( d ) F(k)=\sum\limits_{k|d}f(d) F(k)=k∣d∑f(d)
把 f ( k ) = ∑ i = 1 n ∑ j = 1 m [ g c d ( i , j ) = k ] f(k)=\sum\limits_{i=1}^{n}\sum\limits_{j=1}^{m}[gcd(i,j)=k] f(k)=i=1∑nj=1∑m[gcd(i,j)=k]代入 F ( k ) = ∑ k ∣ d f ( d ) F(k)=\sum\limits_{k|d}f(d) F(k)=k∣d∑f(d)
得到 F ( k ) = ∑ k ∣ d ∑ i = 1 n ∑ j = 1 m [ g c d ( i , j ) = d ] F(k)=\sum\limits_{k|d}\sum\limits_{i=1}^{n}\sum\limits_{j=1}^{m}[gcd(i,j)=d] F(k)=k∣d∑i=1∑nj=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}\sum\limits_{k|d}[gcd(i,j)=d] k∣d∑i=1∑nj=1∑m[gcd(i,j)=d]=i=1∑nj=1∑mk∣d∑[gcd(i,