#gcd&lcm&欧拉函数——典的推柿子#

一.

$$\begin{gathered} \sum _{i=1}^n[\gcd (i,n)=k] \\ =\sum _{i=1}^n[\gcd (\frac{i}{k},\frac{n}{k})=1)] \\ =\phi (\frac{n}{k}) \end{gathered}$$

二.

$$\begin{gathered} \sum _{i=1}^n\gcd (i,n) \\ =\sum _{d\mid n}d\sum _{i=1}^n[\gcd (i,n)=d] \\ =\sum _{d\mid n}d\sum _{i=1}^n[\gcd (\frac{i}{d},\frac{n}{d})=1] \\ =\sum _{d\mid n}d\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }[\gcd (i,\frac{n}{d})=1] \\ =\sum _{d\mid n}d\phi (\lfloor \frac{n}{d}\rfloor ) \end{gathered}$$

三.

$$\begin{gathered} \sum _{i=1}^n\sum _{j=1}^n\gcd (i,j) \\ =\sum _{i=1}^n\sum _{j=1}^n\sum _{d\mid \gcd (i,j)}\phi (d) \\ =\sum _{i=1}^n\sum _{j=1}^n\sum _{d=1}^n\phi (d)[d\mid i][d\mid j] \\ =\sum _{d=1}^n\phi (d)\sum _{i=1}^n\sum _{j=1}^n[d\mid i][d\mid j] \\ =\sum _{d=1}^n\phi (d){\lfloor \frac{n}{d}\rfloor }^2 \end{gathered}$$

四.

$$\begin{gathered} \sum _{i=1}^n\mathrm{lcm}(m,n) \\ =\sum _{i=1}^n\frac{ni}{\gcd (n,i)} \\ =n\sum _{i=1}^n\frac{i}{\gcd (n,i)} \\ =n\sum _{d\mid n}\sum _{i=1}^n\frac{i}{d}[\gcd (i,n)=d] \\ =n\sum _{d\mid n}\sum _{i=1}^n\frac{i}{d}[\gcd (\frac{i}{d},\frac{n}{d})=1] \\ =n\sum _{d\mid n}\sum _{i=1}^{d}i[\gcd (i,d)=1] \\ =n\sum _{d\mid n}\frac{\phi (d)}{2}d \end{gathered}$$