题目描述:
求:
∑ni=1φ(i)
1 <= n <= 10
题解:
杜教筛第二道裸题。
必要结论:
∑i|nφ(i)=n
证明:
设f(n) =
∑i|nφ(i)
将n分解质因数,n =
∏pqii
利用莫比乌斯函数里学到的一个性质,可以得到:
f(n)=∏f(pqii)
∵
f(pq)
=∑qk=0φ(pk)
=(∑qk=1pk−pk−1)
+ 1
=pq
∴ f(n)=n
设s(n) = ∑ni=1φ(i)
∑ni=1∑j|nφ(j)
=∑ni=1f(i)
=n∗(n+1)/2
∑ni=1s(n/i)
∑ni=1∑n/ij=1φ(j)
=∑ni=1∑j|nφ(j)
=n∗(n+1)/2
s(n)
=n∗(n+1)/2−∑ni=2s(n/i)
利用和前一篇博客(莫比乌斯函数)同样的方法处理即可。
Code:
#include<cstdio>
#define ll long long
#define fo(i, x, y) for(int i = x; i <= y; i ++)
using namespace std;
const int Maxn = 21544346, m = 1191279, mo = 1000000007;
bool bb, bz[Maxn + 1];
int p[1362202], phi[Maxn + 1];
ll n, ni = 500000004, h[m], f[m];
int hash(ll x) {
int y = x % m;
while(h[y] != 0 && h[y] != x) y = (y + 1) % m;
if(h[y] == x) bb = 1;
h[y] = x; return y;
}
void Build() {
phi[1] = 1;
fo(i, 2, Maxn) {
if(!bz[i]) p[++ p[0]]= i, phi[i] = i - 1;
fo(j, 1, p[0]) {
if(i * p[j] > Maxn) break;
int k = i * p[j]; bz[k] = 1;
if(i % p[j] == 0) {
phi[k] = phi[i] * p[j]; break;
}
phi[k] = phi[i] * (p[j] - 1);
}
phi[i] = (phi[i] + phi[i - 1]) % mo;
}
}
ll dg(ll x) {
if(x <= Maxn) return phi[x];
bb = 0;
int w = hash(x);
if(bb) return f[w];
ll ans = 0;
for(ll i = 2; i <= x; i ++) {
ll j = x / (x / i);
ans += dg(x / i) * (j - i + 1) % mo - mo, ans %= mo;
i = j;
}
x %= mo;
ans = (x * (x + 1) % mo * ni % mo - ans + mo) % mo;
f[w] = ans;
return ans;
}
int main() {
Build();
scanf("%lld", &n);
printf("%lld", dg(n));
}