狄利克雷卷积

# 定义

设 ff 和 gg 都是数论函数
定义 ff 和 gg 的狄利克雷卷积为 HH ,使得 H=f∗gH=f*g

# 公式表示

H(n)=∑i∗j=nf(i)×g(j)H(n)=\sum\limits_{i * j=n}f(i)\times g(j)
H(n)=∑i∣nf(i)×g(ni)H(n)=\sum\limits_{i|n}f(i)\times g(\frac ni)

# 定理

# 总览

若 ff 和 gg 都是积性函数,则 f∗gf * g 也是积性函数
f∗g=g∗ff * g=g * f
(f∗g)∗h=f∗(g∗h)(f * g) * h=f * (g * h)
f∗(g+h)=f∗g+f∗hf * (g+h)=f * g+f * h

# 证明

# 若 ff 和 gg 都是积性函数,则 f∗gf * g 也是积性函数

(f∗g)(n)×(f∗g)(m)=∑i∣nnf(i)×g(ni)×∑j∣mmf(j)×g(mj)=∑i∣nn∑j∣mmf(i)×f(j)×g(ni)×g(mj)=∑ij∣nmnmf(ij)×g(nmij)(nm=d,ij=k)=∑k∣ddf(k)×g(dk)=(f∗g)(d)\begin{aligned} &(f * g)(n)\times (f * g)(m)\\ =&\sum\limits_{i|n}^nf(i)\times g(\frac ni)\times \sum\limits_{j|m}^mf(j)\times g(\frac mj)\\ =&\sum\limits_{i|n}^n\sum\limits_{j|m}^mf(i)\times f(j)\times g(\frac ni)\times g(\frac mj)\\ =&\sum\limits_{ij|nm}^{nm} f(ij)\times g(\frac{nm}{ij})\qquad\qquad &(nm=d,\;ij=k)\\ =&\sum\limits_{k|d}^df(k)\times g(\frac dk)\\ =&(f * g)(d) \end{aligned}

得证

# f∗g=g∗ff * g=g * f

(f∗g)(n)=∑i∣nf(i)×g(ni)(j=ni)=∑j∣ng(j)×f(ni)=(g∗f)(n)\begin{aligned} &(f * g)(n)\\ =&\sum\limits_{i|n}f(i)\times g(\frac ni)\qquad\qquad&(j=\frac ni)\\ =&\sum\limits_{j|n}g(j)\times f(\frac ni)\\ =&(g * f)(n) \end{aligned}

得证

# (f∗g)∗h=f∗(g∗h)(f * g) * h=f * (g * h)

((f∗g)∗h)(n)=∑xy=n(f∗g)(x)×h(y)=∑xy=n(∑zw=xf(z)×g(w))×h(y)=∑zwy=n(g(w)×h(y))×f(z)=∑xz=n(∑wy=xg(w)×h(y))×f(z)=∑xz=n(g∗h)(x)×f(z)=(f∗(g∗h))(n)\begin{aligned} &((f * g) * h)(n)\\ =&\sum\limits_{xy=n}(f * g)(x)\times h(y)\\ =&\sum\limits_{xy=n}(\sum\limits_{zw=x}f(z)\times g(w))\times h(y)\\ =&\sum\limits_{zwy=n}(g(w)\times h(y))\times f(z)\\ =&\sum\limits_{xz=n}(\sum\limits_{wy=x}g(w)\times h(y))\times f(z)\\ =&\sum\limits_{xz=n}(g * h)(x)\times f(z)\\ =&(f * (g * h))(n) \end{aligned}

得证

# f∗(g+h)=f∗g+f∗hf * (g+h)=f * g+f * h

(f∗(g+h))(n)=∑xy=nf(x)×(g+h)(y)=∑xy=nf(x)×(g(y)+h(y))=∑xy=nf(x)×g(y)+f(x)×h(y)=∑xy=nf(x)×g(y)+∑xy=nf(x)×h(y)=(fg+f∗h)(n)\begin{aligned} &(f * (g+h))(n)\\ =&\sum\limits_{xy=n}f(x)\times (g+h)(y)\\ =&\sum\limits_{xy=n}f(x)\times(g(y)+h(y))\\ =&\sum\limits_{xy=n}f(x)\times g(y)+f(x)\times h(y)\\ =&\sum\limits_{xy=n}f(x)\times g(y)+\sum\limits_{xy=n}f(x)\times h(y)\\ =&(fg+f * h)(n) \end{aligned}

得证

# 推论

# 总览

1∗1=d\;1 * 1=d
1∗Id=σ\;1 * Id=\sigma
μ∗1=ε\;\mu * 1=\varepsilon
ϕ∗1=Id\;\phi * 1=Id
μ∗Id=ϕ\;\mu * Id=\phi

# 证明

# 1∗1=d1 * 1=d

(1∗1)(n)=∑i∣n1=d(n)\begin{aligned} &(1 * 1)(n)\\ =&\sum\limits_{i|n}1\\ =&d(n) \end{aligned}

# 1∗Id=σ1 * Id=\sigma

(1∗Id)(n)=(Id∗1)(n)=∑i∣nId(i)=σ(n)\begin{aligned} &(1 * Id)(n)\\ =&(Id * 1)(n)\\ =&\sum\limits_{i|n}Id(i)\\ =&\sigma(n) \end{aligned}

# μ∗1=ε\mu * 1=\varepsilon

设 kk 是 nn 的质因子个数

(μ∗1)(n)(n=∏p∣npa,n′=∏p∣np)=(μ∗1)(n′)=∑d∣n′μ(d)=∑i=0k(ki)(−1)i1k−i=(−1+1)k={k=01k≠00=ε(n)\begin{aligned} &(\mu * 1)(n)\quad\quad&(n=\prod\limits_{p|n}p^a,\;n'=\prod\limits_{p|n}p)\\ =&(\mu * 1)(n')\\ =&\sum\limits_{d|n'}\mu(d)\\ =&\sum\limits_{i=0}^k\binom ki(-1)^i1^{k-i}\\ =&(-1+1)^k\\ =&\left\{\begin{aligned}k=0\quad&1\\k\neq0\quad&0\end{aligned}\right.\\ =&\varepsilon(n) \end{aligned}

# ϕ∗1=Id\phi * 1=Id

∀d∣m,1≤a≤n,(a,n)=d→(ad,nd)=1\forall d|m,\;1\le a\le n,\;(a,n)=d\rightarrow(\frac ad,\frac nd)=1
这样的 aa 可以选 ϕ(md)\phi(\frac md) 个
∴n=∑d∣nϕ(nd)\therefore n=\sum\limits_{d|n}\phi(\frac nd)
∴(ϕ∗1)(n)=Id(n)\therefore (\phi * 1)(n)=Id(n)

# μ∗Id=ϕ\mu * Id=\phi

我们可以根据已有的推论
∵ϕ∗1=Id\because\phi * 1=Id
∴ϕ∗1∗μ=Id∗μ\therefore\phi * 1 * \mu=Id * \mu
∵μ∗1=ε\because\mu * 1=\varepsilon
∴ϕ∗ε=Id∗μ\therefore\phi * \varepsilon=Id * \mu
观察左边的 =∑d∣nϕ(d)ε(nd)=\sum\limits_{d|n}\phi(d)\varepsilon(\frac nd)
在 d≠nd\neq n 无贡献,因为 ε(nd)=0\varepsilon(\frac nd)=0
在 d=nd=n 有贡献 =ϕ(n)×1=ϕ(n)=\phi(n)\times 1=\phi(n)
∴Id∗μ=ϕ\therefore Id * \mu=\phi

# 例题

洛谷P1447
题目地址 (opens new window)
题解地址 (opens new window)

Last Updated: 10/14/2023, 7:51:49 PM