对一道数论题的推演

求：

$$\sum_{i=1}^n i[\gcd(i, n) = 1]$$

求法1

令

$$S = \sum_{i=1}^n i[\gcd(i, n) = 1] = \sum_{i=0}^n i[\gcd(i, n) = 1]$$
$$S = \sum_{i=0}^n (n-i)[\gcd(n-i, n) = 1]$$
由欧几里得算法可知： $\gcd(a, b) = \gcd(b, a-b)$
$$S = \sum_{i=0}^n (n-i)[\gcd(i, n) = 1]$$
故 $$2S = \sum_{i=0}^n n[\gcd(i, n) = 1] = n\sum_{i=0}^n [\gcd(i, n) = 1] = n(\phi(n)+[n=1])$$
即 $$\sum_{i=1}^n i[\gcd(i, n) = 1] = \frac{n(\phi(n)+[n=1])}{2}$$

求法2

$$\begin{align*} f(n) = & \sum_{i=1}^n i[\gcd(i, n) = 1] \\ = & \sum_{i=1}^n i \sum_d \mu(d)[d|i][d|n] \\ = & \sum_{d|n} \mu(d) \sum_{i=1}^n [d|i]i \\ = & \sum_{d|n} \mu(d) \sum_{i=1}^{\frac{n}{d}} id \\ = & \sum_{d|n} d\mu(d) \sum_{i=1}^{\frac{n}{d}}{i} \\ = & \sum_{d|n} d\mu(d) \frac{\frac{n}{d}(\frac{n}{d}+1)}{2} \\ = & \frac{n}{2} \sum_{d|n} \mu(d) (\frac{n}{d}+1) \\ = & \frac{n}{2}\phi(n) + \frac{n}{2}\sum_{d|n} \mu(d) \\ = & \frac{n(\phi(n)+[n=1])}{2} \end{align*}$$