luogu P3768 简单的数学题

题目描述

今有 $n,p\in {\mathbb{N}}^{\ast }$，求$$\sum _{i=1}^n\sum _{j=1}^{n}ij\cdot \gcd (i,j)$$
$n\le 10^{10}$。

Solution

设$$\begin{array}{rl}S(n)& =\sum _{i=1}^n\sum _{j=1}^{n}ij\cdot \gcd (i,j)\\ & =\sum _{k=1}^n\sum _{i=1}^n\sum _{j=1}^{n}ij\cdot [\gcd (i,j)=k]\\ & =\sum _{k=1}^n\sum _{i=1}^{\lfloor \frac{n}{k}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{k}\rfloor }kij\cdot [\gcd (i,j)=k]\\ & =\sum _{k=1}^n\sum _{i=1}^{\lfloor \frac{n}{k}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{k}\rfloor }{k}^{3}ij[\gcd (i,j)=1]\end{array}$$
因为$$\mu \ast I=ϵ$$所以$$\sum _{d|\gcd (i,j)}\mu (d)=[\gcd (i,j)=1]$$
即$$\begin{array}{rl}S(n)& =\sum _{k=1}^n\sum _{i=1}^{\lfloor \frac{n}{k}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{k}\rfloor }{k}^{3}ij\cdot \sum _{d|\gcd (i,j)}\mu (d)\\ & =\sum _{k=1}^n\sum _{i=1}^{\lfloor \frac{n}{k}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{k}\rfloor }{k}^{3}ij\cdot \sum _{d=1}^{\lfloor \frac{n}{k}\rfloor }\mu (d)\cdot [d|\gcd (i,j)]\\ & =\sum _{k=1}^n\sum _{d=1}^{\lfloor \frac{n}{k}\rfloor }(\sum _{i=1}^{\lfloor \frac{n}{k}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{k}\rfloor }ij)\cdot k^3\cdot \mu (d)\cdot [d|\gcd (i,j)]\\ & =\sum _{k=1}^n\sum _{d=1}^{\lfloor \frac{n}{k}\rfloor }(\sum _{i=1}^{\lfloor \frac{n}{kd}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{kd}\rfloor }ij)\cdot k^3{d}^2\cdot \mu (d)\end{array}$$
令$$F(x)=\sum _{i=1}^x\sum _{j=1}^{x}ij=[\frac{x(x+1)}{2}{]}^2$$$$D=kd$$
则$$\begin{array}{rl}S(n)& =\sum _{k=1}^n{k}^3\sum _{d=1}^{\lfloor \frac{n}{k}\rfloor }F(\lfloor \frac{n}{kd}\rfloor )\mu (d)\cdot d^2\\ & =\sum _{k=1}^n{k}^3\cdot \sum _{D=1}^{\lfloor \frac{n}{k}\rfloor }F(\lfloor \frac{n}{D}\rfloor )\mu (d)\cdot (\frac{D}{k}{)}^2\\ & =\sum _{k=1}^n\sum _{k|D}^{D\le n}F(\lfloor \frac{n}{D}\rfloor )\mu (d)\cdot kD\\ & =\sum _{D=1}^n\sum _{k|D}F(\lfloor \frac{n}{D}\rfloor )\mu (d)\cdot kD\\ & =\sum _{D=1}^{n}F(\lfloor \frac{n}{D}\rfloor )D\cdot [\sum _{k|D}\mu (\frac{D}{k})k]\end{array}$$
因为$$\mu \ast id=\phi$$所以
$$S(n)=\sum _{D=1}^n{D}^{2}F(\lfloor \frac{n}{D}\rfloor )\phi (D)$$
注意到 $f$ 里有一项是 $\phi$，考虑$$\phi \ast I=id$$设$$\begin{array}{rl}f(x)& =x^2\phi (x),\\ g(x)& =i{d}^2(x)=x^2,\\ h(x)& =x^3\\ S^{\prime }(x)& =\sum _{i=1}^x{i}^2\phi (i)\end{array}$$则$$f\ast g=h$$
根据 杜教筛 的套路，得$$g(1)S^{\prime }(n)=\sum _{i=1}^{n}h(i)-\sum _{d=2}^{n}g(d)\cdot S^{\prime }(\lfloor \frac{n}{d}\rfloor )$$即$$S^{\prime }(n)=\sum _{i=1}^{n}h(i)-\sum _{d=2}^n{d}^2{S}^{\prime }(\lfloor \frac{n}{d}\rfloor )$$$$S(n)=\sum _{D=1}^{n}F(\lfloor \frac{n}{D}\rfloor )S^{\prime }(D)$$

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<map>

#define reg register
const int MAXN=5000010;
typedef long long ll;
ll mod,n;
bool vis[MAXN+10];
int p[MAXN+10];
ll phi[MAXN+10];
int len=0;
ll S_f[MAXN+10];
ll inv6;

std::map<ll,ll> mp;

ll ksm(ll x,ll p){
	if(!p) return 1;
	ll c=ksm(x,p/2)%mod;
	if(p&1) return c*c%mod*x%mod;
	return c*c%mod;
}
ll F(ll x){
	x%=mod;
	return x*(x+1)/2%mod*(x*(x+1)/2%mod)%mod;
}
void init(){
	memset(vis,1,sizeof(vis));vis[1]=0;
	memset(p,0,sizeof(p));len=0;phi[1]=1;
	for(reg int i=2;i<=MAXN;++i){
		if(vis[i]){
			p[++len]=i;
			phi[i]=(i-1)%mod;
		}
		for(reg int j=1;(j<=len)&&(i*p[j]<=MAXN);++j){
			vis[i*p[j]]=0;
			if(i%p[j])
				phi[i*p[j]]=phi[i]*(p[j]-1)%mod;
			else{
				phi[i*p[j]]=phi[i]*p[j]%mod;
				break;
			}
		}
	}
	S_f[0]=0;
	for(reg int i=1;i<=MAXN;++i)
		S_f[i]=(S_f[i-1]+phi[i]*i%mod*i%mod)%mod;
}
ll Sq(ll x){
	x%=mod;
	return x*(x+1)%mod*(x+x+1)%mod*inv6%mod;
}
ll S(ll x){
	if(x<MAXN) return S_f[x];
	if(mp[x]) return mp[x];
	ll sum=0;
	for(reg ll l=2,r;l<=x;l=r+1){
		r=x/(x/l);
		sum=(sum+S(x/l)*(Sq(r)-Sq(l-1)+mod)%mod)%mod;
	}
	return mp[x]=((F(x)-sum+mod)%mod);
}
int main(){
	scanf("%lld%lld",&mod,&n);
	init();inv6=ksm(6,mod-2);
	ll ans=0;
	for(reg ll l=1,r;l<=n;l=r+1){
		r=n/(n/l);
		ans=(ans+F(n/l)*(S(r)-S(l-1)+mod)%mod)%mod;
	}
	printf("%lld",ans);
}

注意点乘和 Dirichlet 卷积的区别！！！