上套路
-
反演
F ( n ) = ∑ d ∣ n f ( d ) = > f ( n ) = ∑ d ∣ n μ ( d ) F ( n d ) F(n)=\sum\limits_{d|n}f(d)=>f(n)=\sum\limits_{d|n}\mu(d)F(\frac{n}d) F(n)=d∣n∑f(d)=>f(n)=d∣n∑μ(d)F(dn)
F ( n ) = ∑ n ∣ d f ( d ) = > f ( n ) = ∑ n ∣ d μ ( d n ) F ( d ) F(n)=\sum\limits_{n|d}f(d)=>f(n)=\sum\limits_{n|d}\mu(\frac{d}n)F(d) F(n)=n∣d∑f(d)=>f(n)=n∣d∑μ(nd)F(d) -
μ 与 ϕ \mu与\phi μ与ϕ
∑ d ∣ n μ ( d ) = [ n = = 1 ] \sum\limits_{d|n}\mu(d)=[n==1] d∣n∑μ(d)=[n==1]
∑ d ∣ n ϕ ( d ) = n \sum\limits_{d|n}\phi(d)=n d∣n∑ϕ(d)=n
ϕ ( n ) n = ∑ d ∣ n μ ( d ) d \frac{\phi(n)}{n}=\sum\limits_{d|n}\frac{\mu(d)}{d} nϕ(n)=d∣n∑dμ(d)
ϕ ( n ) = ∑ d ∣ n μ ( d ) n d \phi(n)=\sum\limits_{d|n}\mu(d)\frac{n}{d} ϕ(n)=d∣n∑μ(d)dn -
σ 约 数 和 \sigma约数和 σ约数和
σ ( n ) = ∑ d ∣ n d \sigma(n)=\sum\limits_{d|n}d σ(n)=d∣n∑d
∑ i = 1 n σ ( i ) = ∑ i = 1 n i ∗ ⌊ n i ⌋ \sum\limits_{i=1}^{n}\sigma(i)=\sum\limits_{i=1}^ni*\left \lfloor \frac{n}{i} \right \rfloor i=1∑nσ(i)=i=1∑ni∗⌊in⌋
σ k ( i ∗ j ) = ∑ x ∣ i n ∑ y ∣ j n [ g c d ( x , y ) = = 1 ] x k ∗ j k / y k \sigma_k(i*j)=\sum\limits_{x|i}^n\sum\limits_{y|j}^n[gcd(x,y)==1]x^k*j^k/y^k σk(i∗j)=x∣i∑ny∣j∑n[gcd(x,y)==1]xk∗jk/yk
k 等 于 0 就 是 约 数 个 数 和 k等于0就是约数个数和 k等于0就是约数个数和 -
杜 教 筛 杜教筛 杜教筛
g 1 S ( n ) = ∑ i = 1 n h ( i ) − ∑ i = 2 n g ( i ) S ( ⌊ n i ⌋ ) g_1S(n)=\sum\limits_{i=1}^nh(i)-\sum\limits_{i=2}^ng(i)S(\left \lfloor \frac{n}{i} \right \rfloor) g1S(n)=i=1∑nh(i)−i=2∑ng(i)S(⌊in⌋)
h = f ∗ g h=f*g h=f∗g
∑ i = 1 n i 2 = n ( n + 1 ) ( 2 n + 1 ) 6 \sum\limits_{i=1}^n{i^2}=\frac{n(n+1)(2n+1)}{6} i=1∑ni2=6n(n+1)(2n+1)
∑ i = 1 n i 3 = ( n ( n + 1 ) 2 ) 2 \sum\limits_{i=1}^n{i^3}=(\frac{n(n+1)}{2})^2 i=1∑ni3=(2n(n+1))2 -
g c d ( a n − b n , a m − b m ) = a g c d ( n , m ) − b g c d ( n , m ) gcd(a^n-b^n,a^m-b^m)=a^{gcd(n,m)}-b^{gcd(n,m)} gcd(an−bn,am−bm)=agcd(n,m)−bgcd(n,m)
g c d ( a n − 1 , a m − 1 ) = a g c d ( n , m ) − 1 gcd(a^n-1,a^m-1)=a^{gcd(n,m)}-1 gcd(an−1,am−1)=agcd(n,m)−1 -
g c d ( F i b m , F i b n ) = F i b g c d ( n , m ) gcd(Fib_m,Fib_n)=Fib_{gcd(n,m)} gcd(Fibm,Fibn)=Fibgcd(n,m)
-
∑ i = 1 n 1 i ∑ j = 1 i l c m ( i , j ) = 1 2 ( ∑ d = 1 n ∑ i = 1 n d i ϕ ( i ) + n ) \sum\limits_{i=1}^n\frac{1}{i}\sum\limits_{j=1}^{i}lcm(i,j)=\frac{1}{2}(\sum\limits_{d=1}^n\sum\limits_{i=1}^{\frac{n}{d}}i\phi(i)+n) i=1∑ni1j=1∑ilcm(i,j)=21(d=1∑ni=1∑dniϕ(i)+n)
51Nod 1244 - 莫比乌斯函数之和
51Nod 1239 - 欧拉函数之和
51Nod 1237 - 最大公约数之和 V3
51Nod 1238 - 最小公倍数之和 V3
51Nod 1227 - 平均最小公倍数
51Nod 1220 - 约数之和
HDU 6706 - huntian oy
洛谷 P2257 - YY的GCD
51Nod 1244 - 莫比乌斯函数之和
回目录
杜教筛, h = μ ∗ g h=\mu*g h=μ∗g卷上恒等函数 I ( n ) , 即 g = 1 I(n),即g=1 I(n),即g=1
则 ∑ i = 1 n h ( i ) = 1 \sum\limits_{i=1}^nh(i)=1 i=1∑nh(i)=1
S ( n ) = 1 − ∑ i = 2 n S ( ⌊ n i ⌋ ) S(n)=1-\sum\limits_{i=2}^nS(\left \lfloor \frac{n}{i} \right \rfloor) S(n)=1−