【疯狂gcd】的推式子过程
∑ i = 1 n ∑ j = 1 n g c d ( i , j ) \sum_{i=1}^n\sum_{j=1}^ngcd(i,j) ∑i=1n∑j=1ngcd(i,j)
= 2 ∑ i = 1 n ∑ j = 1 i g c d ( i , j ) − ∑ 1 = 1 n i =2\sum_{i=1}^n\sum_{j=1}^igcd(i,j)-\sum_{1=1}^ni =2∑i=1n∑j=1igcd(i,j)−∑1=1ni
f ( n ) = ∑ j = 1 n g c d ( n , j ) f(n)=\sum_{j=1}^ngcd(n,j) f(n)=∑j=1ngcd(n,j)
f ( n ) = ∑ d ∣ n d ∑ i = d , d ∣ i n [ g c d ( i , n ) = = d ] f(n)=\sum_{d|n}d\sum_{i=d,d|i}^n[gcd(i,n)==d] f(n)=∑d∣nd∑i=d,d∣in[gcd(i,n)==d]
(令 i = j d i=jd i=jd)
f ( n ) = ∑ d ∣ n d ∑ j = 1 n d [ g c d ( j , n d ) = = 1 ] f(n)=\sum_{d|n}d\sum_{j=1}^{\frac nd}[gcd(j,\frac nd)==1] f(n)=∑d∣nd∑j=1dn[gcd(j,dn)==1]
f ( n ) = ∑ d ∣ n d φ ( n d ) f(n)=\sum_{d|n}d\varphi(\frac nd) f(n)=∑d∣ndφ(dn)
∑ i = 1 n ∑ j = 1 i g c d ( i , j ) \sum_{i=1}^n\sum_{j=1}^igcd(i,j) ∑i=1n∑j=1igcd(i,j)
= ∑ i = 1 n ∑ d ∣ i d φ ( i d ) =\sum_{i=1}^n\sum_{d|i}d\varphi(\frac id) =∑i=1n∑d∣idφ(di)
= ∑ d = 1 n d ∑ i = 1 , d ∣ i n