算法笔记-莫比乌斯反演

莫比乌斯函数 $\mu (n)$

$$\mu (n)=\{\begin{array}{clc}1& & n=1\\ (-1{)}^k& & n=p_1{p}_2...p_k\\ 0& & else\end{array}$$
当$n$有平方因子时，$\mu (n)=0$.
当$n$没有平方因子时，$\mu (n)$取决于分解的素数个数

性质

• 对任意正整数n，${\sum }_{d|n}\mu (d)=[n=1]$
• 对任意正整数n，${\sum }_{d|n}\frac{\mu (d)}{d}=\frac{\varphi (n)}{n}$

莫比乌斯函数是积性函数，可以利用线性筛求出莫比乌斯函数

void get_mu(int n){
	mu[1] = 1;
	for(int i = 2; i <= n; i++){
		if(!vis[i]){
			prime[++cnt] = i;
			mu[i] = -1;
		}
		for(int j = 1; j <= cnt&&i*prime[j] <= n; j++){
			vis[i*prime[j]] = 1;
			if(i%prime[j] == 0){
				mu[i*prime[j]] = 0; //也可以直接break 
				break;
			}
			else
				mu[i*prime[j]] = -mu[i];
		}
	}
}

莫比乌斯反演

F(n)与f(n)定义在非负整数集上，且满足：$$F(n)=\sum _{d|n}f(d)$$则：$$f(n)=\sum _{d|n}\mu (d)F(\frac{n}{d})$$
F(n)与f(n)定义在非负整数集上，且满足：$$F(n)=\sum _{n|d}f(d)$$则：$$f(n)=\sum _{n|d}\mu (\frac{d}{n})F(d)$$

YY的GCD

题意：

$\sum _{i=1}^N\sum _{j=1}^M[gcd(i,j)=prime]$

数据组数 $T=10^{4}N,M\le 10^7$

解析：

设$f(d)$为$gcd(i,j)=d$的个数，设$F(n)$为$gcd(i,j)=kn(k\ge 1)$ 的个数$$f(d)=\sum _{i=1}^N\sum _{j=1}^M[gcd(i,j)=d]$$ $$F(n)=\sum _{n|d}f(d)$$由$F(n)$定义可知，$F(n)=\lfloor \frac{N}{n}\rfloor \lfloor \frac{M}{n}\rfloor$

答案为：$$\sum _{p\in primes}f(p)$$莫比乌斯反演：
$$\sum _{p\in primes}\sum _{p|d}\mu (\frac{d}{p})F(d)$$令$d_1=\frac{d}{p}$： $$\sum _{p\in primes}\sum _{d_1=1}^{min(\lfloor \frac{N}{p}\rfloor ,\lfloor \frac{M}{p}\rfloor )}\mu (d_1)F(d_{1}p)$$代入$F(d_{1}p)$： $$\sum _{p\in primes}\sum _{d_1=1}^{min(\lfloor \frac{N}{p}\rfloor ,\lfloor \frac{M}{p}\rfloor )}\mu (d_1)\lfloor \frac{N}{d_{1}p}\rfloor \lfloor \frac{M}{d_{1}p}\rfloor$$令 $T=d_{1}p$： $$\sum _{T=1}^{min(N,M)}\sum _{t|T,t\in primes}\mu (\lfloor \frac{T}{t}\rfloor )\lfloor \frac{N}{T}\rfloor \lfloor \frac{M}{T}\rfloor$$ $$\sum _{T=1}^{min(N,M)}\lfloor \frac{N}{T}\rfloor \lfloor \frac{M}{T}\rfloor \sum _{t|T,t\in primes}\mu (\lfloor \frac{T}{t}\rfloor )$$
前边可以整除分块，后边可以预处理前缀和

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e7+10;
int mu[maxn], prime[maxn], vis[maxn];
int tot;
ll sum[maxn], f[maxn];
inline ll read(){//读入优化 
	char ch;
	while((ch=getchar())<'0'||ch>'9');
	ll res = ch-48;
	while((ch=getchar())>='0'&&ch<='9')
		res = res*10+ch-48;
	return res;
}
void get_mu(int n){
	mu[1] = 1;
	for(int i = 2; i <= n; i++){
		if(!vis[i]){
			prime[++tot] = i;
			mu[i] = -1;
		}
		for(int j = 1; j <= tot && i*prime[j] <= n; j++){
			vis[i*prime[j]] = 1;
			if(i % prime[j] == 0){
				mu[i*prime[j]] = 0;
				break;
			}
			else
				mu[i*prime[j]] = -mu[i];
		}
	}
	for(int j = 1; j <= tot; j++){
		for(int i = 1; i*prime[j] <= n; i++){
			f[i*prime[j]] += mu[i];
		}
	}
	for(int i = 1; i <= n; i++)
		sum[i] = sum[i-1]+f[i];
}
int N, M;
void solve(){
	ll res = 0;
	//scanf("%lld %lld", &N, &M);
	//cin >> N >> M;
	N = read(), M = read();
	if(N > M)
		swap(N, M);
	int r;
	for(int l = 1; l <= N; l = r+1){
		r = min(N/(N/l), M/(M/l));
		res += 1ll*(N/l)*(M/l)*(sum[r]-sum[l-1]);
	}
	printf("%lld\n", res);
	//cout << res << endl;
}
signed main(){
	int T;
	cin >> T;
	get_mu(10000000);
	while(T--)
		solve();
	return 0;
}

ZAP-Queries

题意：

$\sum _{i=1}^a\sum _{j=1}^b[gcd(i,j)=k]$

解析：

$$\sum _{i=1}^a\sum _{j=1}^b[gcd(i,j)=k]$$$$\sum _{i=1}^{\lfloor \frac{a}{k}\rfloor }\sum _{j=1}^{\lfloor \frac{b}{k}\rfloor }[gcd(i,j)=1]$$ $$\sum _{i=1}^{\lfloor \frac{a}{k}\rfloor }\sum _{j=1}^{\lfloor \frac{b}{k}\rfloor }\sum _{d|gcd(i,j)}\mu (d)$$$$\sum _{i=1}^{\lfloor \frac{a}{k}\rfloor }\sum _{j=1}^{\lfloor \frac{b}{k}\rfloor }\sum _{d=1}^{\lfloor \frac{a}{k}\rfloor }\mu (d)[d|gcd(i,j)]$$将$\mu (d)提前：$ $$\sum _{d=1}^{\lfloor \frac{a}{k}\rfloor }\mu (d)\sum _{i=1}^{\lfloor \frac{a}{k}\rfloor }\sum _{j=1}^{\lfloor \frac{b}{k}\rfloor }[d|gcd(i,j)]$$$$\sum _{d=1}^{\lfloor \frac{a}{k}\rfloor }\mu (d)\lfloor \frac{a}{kd}\rfloor \lfloor \frac{b}{kd}\rfloor$$
同上，后面部分可以整除分块，前面部分可以预处理前缀和

#include<iostream>
using namespace std;
typedef long long ll;
const int maxn = 5e4+10;
int vis[maxn], prime[maxn], tot;
int mu[maxn], sum[maxn];
void get_mu(int n){
	mu[1] = 1;
	for(int i = 2; i <= n; i++){
		if(!vis[i]){
			prime[++tot] = i;
			mu[i] = -1;
		}
		for(int j = 1; j <= tot && i*prime[j] <= n; j++){
			vis[i*prime[j]] = 1;
			if(i%prime[j] == 0){
				mu[i*prime[j]] = 0;
				break;
			} 
			else
				mu[i*prime[j]] = -mu[i];
		}
	}
	for(int i = 1; i <= n; i++)
		sum[i] = sum[i-1]+mu[i];
}
int a, b, d;
void solve(){
	cin >> a >> b >> d;
	if(a > b)
		swap(a, b);
	a = a/d, b = b/d;
	ll res = 0;
	int r = 0;
	for(int l = 1; l <= a; l = r+1){
		r = min(a/(a/l), b/(b/l));
		res += 1ll*(a/l)*(b/l)*(sum[r]-sum[l-1]);
	}
	printf("%lld\n", res);
	return ;
}
int main(){
	get_mu(50000);
	int T;
	cin >> T;
	while(T--)
		solve();
	return 0;
}

Problem b

题意：

$\sum _{i=a}^b\sum _{j=c}^d[gcd(i,j)=k]$

解析：

同上题，先求出 $\sum _{i=1}^a\sum _{j=1}^b[gcd(i,j)=k]$ 的答案，然后容斥一下

代码：

#include<iostream>
using namespace std;
typedef long long ll;
const int maxn = 5e4+10;
int vis[maxn], prime[maxn], tot;
int mu[maxn], sum[maxn];
void get_mu(int n){
	mu[1] = 1;
	for(int i = 2; i <= n; i++){
		if(!vis[i]){
			prime[++tot] = i;
			mu[i] = -1;
		}
		for(int j = 1; j <= tot && i*prime[j] <= n; j++){
			vis[i*prime[j]] = 1;
			if(i%prime[j] == 0){
				mu[i*prime[j]] = 0;
				break;
			} 
			else
				mu[i*prime[j]] = -mu[i];
		}
	}
	for(int i = 1; i <= n; i++)
		sum[i] = sum[i-1]+mu[i];
}
int a, b, c, d, k;
ll ans;
ll solve(int a, int b, int k){
	//cin >> a >> b >> d;
	if(a > b)
		swap(a, b);
	a = a/k, b = b/k;
	ll res = 0;
	int r = 0;
	for(int l = 1; l <= a; l = r+1){
		r = min(a/(a/l), b/(b/l));
		res += 1ll*(a/l)*(b/l)*(sum[r]-sum[l-1]);
	}
	//printf("%lld\n", res);
	return res;
}
int main(){
	get_mu(50000);
	int T;
	cin >> T;
	while(T--){
		cin >> a >> b >> c >> d >> k;
		ans = solve(b, d, k)-solve(a-1, d, k)-solve(b, c-1, k)+solve(a-1, c-1, k);
		printf("%lld\n", ans);
	}
	return 0;
}

https://www.cnblogs.com/peng-ym/p/8652288.html
https://oi-wiki.org/math/number-theory/mobius/