51Nod 1238 - 最小公倍数之和 V3
求 ∑ i = 1 n ∑ j = 1 n l c m ( i , j ) \displaystyle\sum_{i=1}^{n}\displaystyle\sum_{j=1}^{n}lcm(i, j) i=1∑nj=1∑nlcm(i,j)
原式 = ∑ i = 1 n ∑ j = 1 n i × j ( i , j ) = ∑ d = 1 n d × ∑ i = 1 ⌊ n d ⌋ ∑ j = 1 ⌊ n d ⌋ i × j × [ ( i , j ) = 1 ] =\displaystyle\sum_{i=1}^{n}\displaystyle\sum_{j=1}^{n}\frac{i\times j}{(i, j)}=\displaystyle\sum_{d=1}^{n}d\times \displaystyle\sum_{i=1}^{\left \lfloor \frac{n}{d} \right \rfloor} \displaystyle\sum_{j=1}^{\left \lfloor \frac{n}{d} \right \rfloor} i\times j \times [(i, j)=1] =i=1∑nj=1∑n(i,j)i×j=d=1∑nd×i=1∑⌊dn⌋j=1∑⌊dn⌋i×j×[(i,j)=1]
由 ∑ i = 1 n i × [ ( i , n ) = 1 ] = n × ϕ ( n ) 2 \displaystyle\sum_{i=1}^{n}i\times [(i, n)=1]=\frac{n\times\phi(n)}{2} i=1∑ni×[(i,n)=1]=2n×ϕ(n),原式 = ∑ d = 1 n d × ∑ i = 1 ⌊ n d ⌋ i 2 × ϕ ( i ) =\displaystyle\sum_{d=1}^{n}d\times \displaystyle\sum_{i=1}^{\left \lfloor \frac{n}{d} \right \rfloor}i^2\times \phi(i) =d=1∑nd×i=1∑⌊dn⌋i2×ϕ(i)
令 f ( n ) = n 2 × ϕ ( n ) f(n)=n^2\times \phi(n) f(n)=n2×ϕ(n),我们要求 F ( x ) = ∑ i = 1 n f ( i ) F(x)=\displaystyle\sum_{i=1}^{n}f(i) F(x)=i=1∑nf(i)
由 ∑ d ∣ n ϕ ( d ) = n \displaystyle\sum_{d|n}\phi(d)=n d∣n∑ϕ(d)=n,可得 ∑ i = 1 n i 2 × ∑ d ∣ i ϕ ( d ) = ∑ i = 1 n i 3 = n 2 × ( n + 1 ) 2 4 \displaystyle\sum_{i=1}^{n}i^2 \times \displaystyle\sum_{d|i}\phi(d)=\displaystyle\sum_{i=1}^{n}i^3=\frac{n^2\times (n+1)^2}{4} i=1∑ni2×d∣i∑ϕ(d)=i=1∑ni3=4n2×(n+1)2
上式左边可变形为 ∑ i = 1 n ∑ d ∣ i i 2 × ϕ ( d ) = ∑ i = 1 n ∑ d ∣ i d 2 × ϕ ( d ) × ( i d ) 2 = ∑ i = 1 n ∑ d ∣ i f ( d ) × ( i d ) 2 = ∑ i d = 1 n ∑ d = 1 ⌊ n i d ⌋ f ( d ) × ( i d ) 2 = ∑ i = 1 n ∑ d = 1 ⌊ n i ⌋ f ( d ) × i 2 = ∑ i = 1 n i 2 × F ( ⌊ n i ⌋ ) \displaystyle\sum_{i=1}^{n}\displaystyle\sum_{d|i}i^2\times \phi(d)=\displaystyle\sum_{i=1}^{n}\displaystyle\sum_{d|i}d^2\times \phi(d)\times(\frac{i}{d})^2=\displaystyle\sum_{i=1}^{n}\displaystyle\sum_{d|i}f(d)\times(\frac{i}{d})^2=\displaystyle\sum_{\frac{i}{d}=1}^{n}\displaystyle\sum_{d=1}^{\left \lfloor \frac{n}{\frac{i}{d}} \right \rfloor}f(d)\times (\frac{i}{d})^2=\displaystyle\sum_{i=1}^{n}\displaystyle\sum_{d=1}^{\left \lfloor \frac{n}{i} \right \rfloor}f(d)\times i^2=\displaystyle\sum_{i=1}^{n}i^2\times F(\left \lfloor \frac{n}{i} \right \rfloor) i=1∑n
《浅谈一类积性函数的前缀和》例题(未完待续)
最新推荐文章于 2022-07-11 16:02:04 发布