BZOJ4804

最新推荐文章于 2019-06-27 15:29:00 发布

anantheparty

最新推荐文章于 2019-06-27 15:29:00 发布

阅读量685

点赞数 2

分类专栏：数论文章标签： gcd bzoj

本文链接：https://blog.csdn.net/u011327397/article/details/68926090

版权

数论专栏收录该内容

5 篇文章 0 订阅

订阅专栏

= = = = \sum k φ (k) \sum i = 1 n \sum j = 1 n [gcd (i, j) = k] \sum k φ (k) \sum i = 1 n \sum j = 1 n \sum k d | gcd (i, j) μ (d) \sum k φ (k) \sum d μ (d) ⌊ n k d ⌋ 2 \sum t \sum k | t φ (k) μ (t k) ⌊ n t ⌋ 2 \sum t f (t) ⌊ n t ⌋ 2

$\begin{align} &\sum_{k}\varphi(k)\sum_{i=1}^n\sum_{j=1}^n[\gcd(i,\ j)=k]\\ =&\sum_{k}\varphi(k)\sum_{i=1}^n\sum_{j=1}^n\sum_{kd|\gcd(i,\ j)}\mu(d)\\ =&\sum_{k}\varphi(k)\sum_{d}\mu(d)\left\lfloor\frac{n}{kd}\right\rfloor^2\\ =&\sum_{t}\sum_{k|t}\varphi(k)\mu\left(\frac{t}{k}\right)\left\lfloor\frac{n}{t}\right\rfloor^2\\ =&\sum_{t}f(t)\left\lfloor\frac{n}{t}\right\rfloor^2 \end{align}$
其中，

f (n) = \sum d | n φ (d) μ (n d)

$\begin{align} f(n)=&\sum_{d|n}\varphi(d)\mu\left(\frac{n}{d}\right) \end{align}$
线性筛：

f (p r) = \sum k = 0 r φ (p k) μ (p r - k) = φ (p r) μ (1) + φ (p r - 1) μ (p) = φ (p r) - φ (p r - 1)

$\begin{align} f(p^r)&=\sum_{k=0}^r\varphi(p^k)\mu(p^{r-k})\\ &=\varphi(p^r)\mu(1)+\varphi(p^{r-1})\mu(p)\\ &=\varphi(p^r)-\varphi(p^{r-1}) \end{align}$
杜教筛：

= = \sum i = 1 n f (i) \sum i = 1 n \sum j | i φ (j) μ (i j) \sum i = 1 n φ (i) \sum j = 1 ⌊ n / i ⌋ μ (j)

$\begin{align} &\sum_{i=1}^nf(i)\\ =&\sum_{i=1}^n\sum_{j|i}\varphi(j)\mu\left(\frac{i}{j}\right)\\ =&\sum_{i=1}^n\varphi(i)\sum_{j=1}^{\lfloor n/i\rfloor}\mu(j) \end{align}$
实测杜教筛远慢于线性筛