说一下积性函数咯（更新中）.

$\qquad$说一下积性函数咯.

积性函数

$\qquad$积性函数（Multiplicative function）就是满足$f(1)=1$且$f(ab)=f(a)*f(b)$的函数，而且它在数论中也起到比较大的作用.. 常见的有欧拉函数$\phi$、默比乌斯函数$\mu$、约数个数$\sigma$、只有1才等于1的函数$\epsilon$..

---

欧拉函数

$\qquad$欧拉函数是积性函数中算是比较多用的函数了，$\phi(n)$表示与$n$互质且比$n$小的数的个数，例如：$\phi(8)=4$、$\phi(64)=16$、$\phi(100)=40$..
$\qquad$欧拉函数有以下几个性质：

$\phi(p^k)=(p-1)p^{k-1}$
$\qquad$设 $n=p_1^{r_1}p_2^{r_2}p_3^{r^3}\dots p_k^{r_k}$，则
$\phi(n)=\prod\limits_{1\leq i\leq k}\phi(p_i^{r_i})$
$\phi(n)=\prod\limits_{1\leq i\leq k}p_i^{r_i-1}(p_i-1)$
$\phi(n)=n\prod\limits_{p|n}(1-\frac{1}{p})$

---

欧拉定理

$\qquad$对于正整数$a$和$n$，若$(a,n)=1$，那么$a^{\phi(n)}\equiv 1 \pmod{n}$

$\qquad$下面有一个简单的推论：

$\qquad$在$(a,n)=1$的情况下，如果有$a^x\equiv a^y\pmod{n}$，那么定有$x\equiv y\pmod{\phi(n)}$

---

积性函数的一些应用

说在前面

$\qquad$有一些公式是比较常用的，下面给出：

$n=\sum\limits_{d|n}\phi(d)$
$\epsilon(n)=\sum\limits_{d|n}\mu(d)$（莫比乌斯反演）
$\sum\limits_{1\leq i\leq\frac{n}{d}}1=\lfloor\frac{n}{d}\rfloor$
$\sum\limits_{1\leq i\leq n}\sum\limits_{1\leq j\leq m}ij=\dfrac{(1+n)n(1+m)m}{4}$

$\qquad$虽然这些公式都非常简单，但是能真正在做题的时候用到并不是一件容易的事，希望所有来看这篇博文的人都注意一下

例题1：[bzoj1257]CQOI2007余数之和

题意：求$\sum\limits_{1\leq i\leq n}k\ mod\ i\ (n\leq 10^9)$

$\qquad\qquad\quad\sum\limits_{1\leq i\leq n}k\ mod\ i$
$\qquad\qquad=\sum\limits_{1\leq i\leq n}\lfloor\frac{k}{i}\rfloor i$
$\qquad\qquad=nk-\sum\limits_{1\leq i\leq n}\lfloor\frac{k}{i}\rfloor i$

$\qquad$由于$\lfloor\frac{k}{i}\rfloor$对于某些不同的$i$是会相同的，而且对于从$1$到$n$是一个非递增的序列，所以我们可以用分块来解决

$\qquad$如果$i$是当前这一块最靠左的端点，那么$j=\frac{k}{\lfloor\frac{k}{i}\rfloor}$便是这一块最靠右的端点

$\qquad$这样的分块计算答案的时间复杂度为$O(\sqrt{n})$

code

/**************************************************************
    Problem: 1257
    Language: C++
    Result: Accepted
    Time:8 ms
    Memory:804 kb
****************************************************************/

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define LL long long
using namespace std;
LL n, K;
int main (){
    LL i, j, k;
    scanf ( "%lld%lld", &n, &K );
    LL sum = 0;
    i = 1;
    while ( i <= n ){
        k = K/i;
        if ( k == 0 ) j = n;
        else j = K/k;
        if ( j > n ) j = n;
        sum += (i+j)*(j-i+1)/2*k;
        i = j+1;
    }
    printf ( "%lld\n", K*n-sum );
    return 0;
}

例题2：[bzoj2705]SDOI2012longge

题意：求$\sum\limits_{1\leq i\leq n}(i,n)\ (n\leq 10^9)$

枚举$d=(i,n)$，设$i=i'd$

$\qquad\qquad\quad\sum\limits_{1\leq i\leq n}(i,n)$
$\qquad\qquad=\sum\limits_{d|n}\sum\limits_{i'd\leq n,(i'd,n)=d}d$
$\qquad\qquad=\sum\limits_{d|n}d\sum\limits_{i'\leq\frac{n}{d},(i',\frac{n}{d})=1}1$

由于$\sum\limits_{i'\leq\frac{n}{d},(i',\frac{n}{d})=1}1$便是求与$\frac{n}{d}$互质且比它小的数的个数，所以

$\qquad\qquad=\sum\limits_{d|n}d\phi(\frac{n}{d})$

$\qquad$那么我们只需要枚举d即可，时间复杂度$O(\sqrt{n})$

code

/**************************************************************
    Problem: 2705
    Language: C++
    Result: Accepted
    Time:16 ms
    Memory:1300 kb
****************************************************************/

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#define LL long long
using namespace std;
LL n;
LL nu[31000], sum[31000], tot, ans;
void dfs ( LL x, LL phi, LL num ){
    if ( x == tot+1 ) ans += n/num*phi;
    else {
        LL pf = 1;
        dfs ( x+1, phi, num );
        for ( LL i = 1; i <= sum[x]; i ++ ){
            dfs ( x+1, phi*pf*(nu[x]-1), num*pf*nu[x] );
            pf *= nu[x];
        }
    }
}
int main (){
    LL i, j, k;
    scanf ( "%lld", &n );
    tot = 0;
    LL x = n;
    for ( i = 2; i <= sqrt(n); i ++ ){
        if ( x % i == 0 ){
            tot ++;
            nu[tot] = i;
            while ( x % i == 0 ){ sum[tot] ++; x /= i; }
        }
    }
    tot ++;
    nu[tot] = x; sum[tot] = 1;
    ans = 0;
    dfs ( 1, 1, 1 );
    printf ( "%lld\n", ans );
    return 0;
}

例题3：[bzoj2226]SPOJ LCMSUM

题意：求$\sum\limits_{1\leq i\leq n}[i,n]\ (n\leq 10^7)$

枚举$d$令$(i,n)=d$，设$i=i'd$
$\qquad\qquad\quad\sum\limits_{1\leq i\leq n}[i,n]$
$\qquad\qquad=\sum\limits_{d|n}\sum\limits_{i'\leq\frac{n}{d},(i'd,n)=d}\dfrac{i'dn}{d}$
$\qquad\qquad=\sum\limits_{d|n}\sum\limits_{i'\leq\frac{n}{d},(i',\frac{n}{d})=1}i'n$
$\qquad\qquad=n\sum\limits_{d|n}\sum\limits_{i'\leq\frac{n}{d},(i',\frac{n}{d})=1}i'$
这里要用到这个公式：
$\qquad\qquad\qquad\sum\limits_{d\leq n,(d,n)=1}d=\dfrac{\phi(d)d}{2}$
但是当$n=1$的时候并不满足上述公式，少了$\dfrac{1}{2}$，所以我们可以把它加上（反正其他的$n$加上$\dfrac{1}{2}$也不会有什么变化）
$\qquad\ $原式$=n(\dfrac{1}{2}+\sum\limits_{d|n}\dfrac{\phi(\frac{n}{d})\frac{n}{d}}{2})$

$\qquad\qquad=\dfrac{n(1+\sum_{d|n}\phi(\frac{n}{d})\frac{n}{d})}{2}$

$\qquad$我们可以在线性时间内求出$\phi(\frac{n}{d})$的值，同时我们也可以在$O(nlogn)$的时间内求出$\sum_{d|n}\phi(\frac{n}{d})\frac{n}{d}$的值（有$O(n)$的方法，但是我好像不会0.0）
$\qquad$所以这道题就变成了一个$O(nlogn)$预处理、$O(1)$询问的问题

code

/**************************************************************
    Problem: 2226
    Language: C++
    Result: Accepted
    Time:7308 ms
    Memory:27660 kb
****************************************************************/

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#define LL long long
using namespace std;
const int Maxn = 1100000;
LL n;
LL phi[Maxn], prime[Maxn], pr;
LL ans[Maxn];
bool v[Maxn];
void ss (){
    memset ( v, true, sizeof (v) );
    int i, j;
    phi[1] = 1;
    for ( i = 2; i <= 1000000; i ++ ){
        if ( v[i] == true ){
            prime[++pr] = i;
            phi[i] = i-1;
        }
        for ( j = 1; j <= pr && i*prime[j] <= 1000000; j ++ ){
            v[i*prime[j]] = false;
            if ( i % prime[j] == 0 ){
                phi[i*prime[j]] = phi[i] * prime[j];
                break;
            }
            else phi[i*prime[j]] = phi[i] * phi[prime[j]];
        }
    }
    for ( i = 1; i <= 1000000; i ++ ){
        for ( j = i; j <= 1000000; j += i ){
            ans[j] += i*phi[i];
        }
    }
}
int main (){
    LL i, j, k;
    LL T;
    scanf ( "%lld", &T );
    ss ();
    while ( T -- ){
        scanf ( "%lld", &n );
        printf ( "%lld\n", (ans[n]+1)*n/2 );
    }
    return 0;
}

例题4：[bzoj2005][Noi2010]能量采集

题意：求$\sum\limits_{1\leq i\leq n}\sum\limits_{1\leq j\leq m}2((i,j)-1)+1\ (1\leq n,m\leq10^5)$

$\qquad$我们可以先简化公式

$\qquad\qquad\quad\sum\limits_{1\leq i\leq n}\sum\limits_{1\leq j\leq m}2((i,j)-1)+1$
$\qquad\qquad=2\sum\limits_{1\leq i\leq n}\sum\limits_{1\leq j\leq m}(i,j)-nm$

$\qquad$那么问题就简化为求$\sum\limits_{1\leq i\leq n}\sum\limits_{1\leq j\leq m}(i,j)$了

$\qquad\qquad\quad\sum\limits_{1\leq i\leq n}\sum\limits_{1\leq j\leq m}(i,j)$
$\qquad\qquad=\sum\limits_{1\leq i\leq n}\sum\limits_{1\leq j\leq m}\sum\limits_{d|(i,j)}\phi(d)$
$\qquad\qquad=\sum\limits_{d}\phi(d)\sum\limits_{i'\leq\frac{n}{d}}\sum\limits_{j'\leq\frac{m}{d}}1$
$\qquad\qquad=\sum\limits_{d}\phi(d)\lfloor\frac{n}{d}\rfloor\lfloor\frac{m}{d}\rfloor$

$\qquad$由于$\lfloor\frac{n}{d}\rfloor\lfloor\frac{m}{d}\rfloor$在某一段的$d$会保持不变，所以我们可以用分块来解决，而$\phi(d)$我们可以在线性时间内筛出预处理即可

code

/**************************************************************
    Problem: 2005
    Language: C++
    Result: Accepted
    Time:80 ms
    Memory:2632 kb
****************************************************************/

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#define LL long long
using namespace std;
const LL Maxn = 110000;
LL n, m;
LL phi[Maxn], prime[Maxn], pr;
bool v[Maxn];
LL _min ( LL x, LL y ){ return x < y ? x : y; }
void ss (){
    phi[1] = 1;
    LL i, j;
    for ( i = 2; i <= 100000; i ++ ){
        if ( v[i] == false ){
            prime[++pr] = i;
            phi[i] = i-1;
        }
        for ( j = 1; j <= pr && i*prime[j] <= 100000; j ++ ){
            v[i*prime[j]] = true;
            if ( i % prime[j] == 0 ){
                phi[i*prime[j]] = phi[i]*prime[j];
                break;
            }
            else phi[i*prime[j]] = phi[i]*phi[prime[j]];
        }
    }
    for ( i = 2; i <= 100000; i ++ ) phi[i] += phi[i-1];
}
int main (){
    LL d, i, j, k;
    scanf ( "%lld%lld", &n, &m );
    if ( n < m ) swap ( n, m );
    ss ();
    d = 1;
    LL ans = 0;
    while ( d <= m ){
        LL kn = n/d, km = m/d;
        LL jn, jm;
        if ( kn == 0 ) jn = n;
        else jn = n/kn;
        if ( jn > n ) jn = n;
        if ( km == 0 ) jm = m;
        else jm = m/km;
        if ( jm > m ) jm = m;
        j = _min ( jn, jm );
        ans += (phi[j]-phi[d-1])*kn*km;
        d = j+1;
    }
    printf ( "%lld\n", ans*2-n*m );
    return 0;
}

例题5：[bzoj1101][POI2007]Zap

题意：求$\sum\limits_{1\leq i\leq n}\sum\limits_{1\leq j\leq m}[(i,j)=d] (1\leq d\leq n,m\leq 5\times10^4)$

设$i=i'd$、$j=j'd$
$\qquad\qquad\quad\sum\limits_{1\leq i\leq n}\sum\limits_{1\leq j\leq m}[(i,j)=d]$
$\qquad\qquad=\sum\limits_{i'\leq\frac{n}{d}}\sum\limits_{j'\leq\frac{m}{d}}[(i',j')=1]$
$\qquad\qquad=\sum\limits_{i'\leq\frac{n}{d}}\sum\limits_{j'\leq\frac{m}{d}}\epsilon(i',j')$
来一波莫比乌斯反演：
$\qquad\qquad\qquad\epsilon(n)=\sum\limits_{d|n}\mu(d)$
所以
$\qquad\qquad=\sum\limits_{i'\leq\frac{n}{d}}\sum\limits_{j'\leq\frac{m}{d}}\sum\limits_{k|(i',j')}\mu(k)$

继续设$i'=i''k$、$j'=j''k$
那么我们又可以继续推到

$\qquad\qquad=\sum\limits_{k}\mu(k)\sum\limits_{i''\leq\frac{n}{dk}}\sum\limits_{j''\leq\frac{m}{dk}}1$
这又回到了一个比较经典的问题：
$\qquad\qquad=\sum\limits_{k}\mu(k)\lfloor\frac{n}{dk}\rfloor\lfloor\frac{m}{dk}\rfloor$

$\qquad$我们可以看出$\mu(k)$可以在线性时间内筛出，然后剩下的可以用分块解决0.0

code

/**************************************************************
    Problem: 1101
    Language: C++
    Result: Accepted
    Time:11132 ms
    Memory:1652 kb
****************************************************************/

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define LL long long
using namespace std;
const LL Maxn = 51000;
LL n, m;
LL mu[Maxn], prime[Maxn], pr;
bool v[Maxn];
LL _min ( LL x, LL y ){ return x < y ? x : y; }
void get_mu (){
    LL i, j, k;
    pr = 0;
    mu[1] = 1;
    memset ( v, false, sizeof (v) );
    for ( i = 2; i <= 50000; i ++ ){
        if ( v[i] == false ){
            prime[++pr] = i;
            mu[i] = -1;
        }
        for ( j = 1; j <= pr && i*prime[j] <= 50000; j ++ ){
            v[i*prime[j]] = true;
            if ( i % prime[j] == 0 ){
                mu[i*prime[j]] = 0;
            }
            else mu[i*prime[j]] = -mu[i];
        }
    }
    for ( i = 2; i <= 50000; i ++ ) mu[i] += mu[i-1];
}
int main (){
    LL i, j, k, T, d, ans;
    scanf ( "%lld", &T );
    get_mu ();
    while ( T -- ){
        scanf ( "%lld%lld%lld", &n, &m, &d );
        if ( n < m ) swap ( n, m );
        n /= d; m /= d;
        i = 1; ans = 0;
        while ( i <= m ){
            LL nk = n/(n/i), mk = m/(m/i);
            j = _min ( nk, mk );
            ans += (n/i)*(m/i)*(mu[j]-mu[i-1]);
            i = j+1;
        }
        printf ( "%lld\n", ans );
    }
    return 0;
}

例题6：[bzoj2154] Crash的数字表格

题意：求$\sum\limits_{1\leq i\leq n}\sum\limits_{1\leq j\leq m}[i,j]\ (n\leq10^7)$
$\qquad\qquad\quad\sum\limits_{1\leq i\leq n}\sum\limits_{1\leq j\leq m}[i,j]$
$\qquad\qquad=\sum\limits_{1\leq i\leq n}\sum\limits_{1\leq j\leq m}\dfrac{ij}{(i,j)}$

枚举$(i,j)=d$，设$i=i'd$、$j=j'd$

$\qquad\qquad=\sum\limits_{d}\sum\limits_{i'\leq\frac{n}{d}}\sum\limits_{j'\leq\frac{m}{d}}\dfrac{i'dj'd}{d}[(i',j')=1]$
$\qquad\qquad=\sum\limits_{d}d\sum\limits_{i'\leq\frac{n}{d}}\sum\limits_{j'\leq\frac{m}{d}}i'j'\times\epsilon(i',j')$
再来一波莫比乌斯反演

$\qquad\qquad=\sum\limits_{d}d\sum\limits_{i'\leq\frac{n}{d}}\sum\limits_{j'\leq\frac{m}{d}}i'j'\sum\limits_{k|(i',j')}\mu(k)$
那么我们再枚举$k$，设$i''=i'k$、$j''=j'k$

$\qquad\qquad=\sum\limits_{d}d\sum\limits_{k}\mu(k)\sum\limits_{i''\leq\frac{n}{dk}}\sum\limits_{j''\leq\frac{m}{dk}}i''kj''k$
$\qquad\qquad=\sum\limits_{d}d\sum\limits_{k}\mu(k)k^2\sum\limits_{i''\leq\frac{n}{dk}}\sum\limits_{j''\leq\frac{m}{dk}}i''j''$
$\qquad\qquad=\dfrac{1}{4}\sum\limits_{d}d\sum\limits_{k}\mu(k)k^2(1+\lfloor\frac{n}{dk}\rfloor)\lfloor\frac{n}{dk}\rfloor(1+\lfloor\frac{m}{dk}\rfloor)\lfloor\frac{m}{dk}\rfloor$

那么上式既枚举了$d$，也枚举了$k$，而且$d$和$k$没有必然的联系，这样的式子是不能在线性时间内实现的
所以我们设$D=dk$，通过枚举$D$来解决我们的问题
$\qquad\qquad=\dfrac{1}{4}\sum\limits_{D}\sum\limits_{d|D}d\mu(\frac{D}{d}){(\frac{D}{d})}^2(1+\lfloor\frac{n}{D}\rfloor)\lfloor\frac{n}{D}\rfloor(1+\lfloor\frac{m}{D}\rfloor)\lfloor\frac{m}{D}\rfloor$
进一步化简该式子
$\qquad\qquad=\dfrac{1}{4}\sum\limits_{D}(1+\lfloor\frac{n}{D}\rfloor)\lfloor\frac{n}{D}\rfloor(1+\lfloor\frac{m}{D}\rfloor)\lfloor\frac{m}{D}\rfloor\sum\limits_{d|D}\mu(\frac{D}{d})\frac{D^2}{d}$

$\qquad$这个式子的后半段是可以在线性时间筛出（其实我不太懂，是翁神教我的），然后前半段又可以通过分块来解决，所以该做法的时间复杂度为$O(n)-O(\sqrt{n})$的

---

最后

$\qquad$先写这么多吧，更难的以后再补了