一、欧拉函数
1、欧拉函数的定义
1 ∼ N 1\sim N 1∼N中与 N N N互质的数的个数被称为欧拉函数，记为 ϕ ( N ) \phi(N) ϕ(N)。
若在算数基本定理中， N = p 1 a 1 p 2 a 2 p 3 a 3 ⋅ ⋅ ⋅ p m a m N=p_1^{a_1}p_2^{a_2}p_3^{a_3}\cdot\cdot\cdot p_m^{a_m} N=p1a1p2a2p3a3⋅⋅⋅pmam，则： ϕ ( N ) = N × p 1 − 1 p 1 × p 2 − 1 p 2 × ⋅ ⋅ ⋅ × p m − 1 p m \phi(N)=N\times\frac{p_1-1}{p_1}\times\frac{p_2-1}{p_2}\times\cdot\cdot\cdot\times \frac{p_m-1}{p_m} ϕ(N)=N×p1p1−1×p2p2−1×⋅⋅⋅×pmpm−1
2、欧拉函数公式的证明过程
设 n = p 1 a 1 p 2 a 2 n=p_1^{a_1}p_2^{a_2} n=p1a1p2a2
ϕ ( n ) = ϕ ( p 1 a 1 p 2 a 2 ) \phi(n)=\phi(p_1^{a_1}p_2^{a_2}) ϕ(n)=ϕ(p1a1p2a2)
= p 1 a 1 p 2 a 2 − p 1 a 1 p 2 a 2 p 1 − p 1 a 1 p 2 a 2 p 2 + p 1 a 1 p 2 a 2 p 1 p 2 =p_1^{a_1}p_2^{a_2}-\frac{{p_1}^{a_1}{p_2}^{a_2}}{p_1}-\frac{{p_1}^{a_1}{p_2}^{a_2}}{p_2}+\frac{{p_1}^{a_1}{p_2}^{a_2}}{{p_1}{p_2}} =p1a1p2a2−p1p1a1p2a2−p2p1a1p2a2+p1p2p1a1p2a2
= p 1 a 1 − 1 p 2 a 2 − 1 ( p 1 p 2 − p 2 − p 1 + 1 ) =p_1^{a_1-1}p_2^{a_2-1}({p_1}{p_2}-{p_2}-{p_1}+1) =p1a1−1p2a2−1(p1p2−p2−p1+1)
= p 1 a 1 − 1 p 2 a 2 − 1 [ p 2 ( p 1 − 1 ) − ( p 1 − 1 ) ] =p_1^{a_1-1}p_2^{a_2-1}[{p_2}(p_1-1)-({p_1}-1)] =p1a1−1p2a2−1[p2(p1−1)−(p1−1)]
= p 1 a 1 − 1 p 2 a 2 − 1 ( p 1 − 1 ) ( p 2 − 1 ) =p_1^{a_1-1}p_2^{a_2-1}({p_1}-1)({p_2}-1) =p1a1−1p2a2−1(p1−1)(p2−1)
= n × p 1 − 1 p 1 × p 2 − 1 p 2 =n\times\frac{p_1-1}{p_1}\times\frac{p_2-1}{p_2} =n×p1p1−1×p2p2−1
所以， ϕ ( n ) = n × p 1 − 1 p 1 × p 2 − 1 p 2 \phi(n)=n\times\frac{p_1-1}{p_1}\times\frac{p_2-1}{p_2} ϕ(n)=n×p1p1−1×p2p2−1
3、代码模板
int phi(int x)
{
int res = x;
for (int i = 2; i <= x / i; i ++ )
if (x % i == 0)
{
res = res / i * (i - 1);
while (x % i == 0) x /= i;
}
if (x > 1) res = res / x * (x - 1);
return res;
}
二、筛法求欧拉函数
1、过程模拟
∙ 注意： \bullet\color{red} 注意： ∙注意：一个质数 i i i 的欧拉函数为 ϕ ( i ) = i − 1 \phi(i)=i-1 ϕ(i)=i−1。
设 i i i是被除数， p j {p_j} pj 是质数。
∙ \bullet ∙当 i % p j = 0 i\%{p_j}=0 i%pj=0时，说明 p j {p_j} pj 是 i i i 的一个质因子，推理如下：
ϕ ( i ) = i × p 1 − 1 p 1 × p 2 − 1 p 2 × ⋅ ⋅ ⋅ × p k − 1 p k \phi(i)=i\times\frac{p_1-1}{p_1}\times\frac{p_2-1}{p_2}\times\cdot\cdot\cdot\times\frac{p_k-1}{p_k} ϕ(i)=i×p1p1−1×p2p2−1×⋅⋅⋅×pkpk−1
ϕ ( p j ⋅ i ) = p j ⋅ i × p 1 − 1 p 1 × p 2 − 1 p 2 × ⋅ ⋅ ⋅ × p k − 1 p k \phi({p_j}\cdot i)={p_j}\cdot i\times\frac{p_1-1}{p_1}\times\frac{p_2-1}{p_2}\times\cdot\cdot\cdot\times\frac{p_k-1}{p_k} ϕ(pj⋅i)=pj⋅i×p1p1−1×p2p2−1×⋅⋅⋅×pkpk−1
= ϕ ( i ) × p j =\phi(i)\times {p_j} =ϕ(i)×pj
∙ \bullet ∙当 i % p j ≠ 0 i\%{p_j}\not =0 i%pj=0时，推理如下：
ϕ ( i ) = i × p 1 − 1 p 1 × p 2 − 1 p 2 × ⋅ ⋅ ⋅ × p k − 1 p k \phi(i)=i\times\frac{p_1-1}{p_1}\times\frac{p_2-1}{p_2}\times\cdot\cdot\cdot\times\frac{p_k-1}{p_k} ϕ(i)=i×p1p1−1×p2p2−1×⋅⋅⋅×pkpk−1
ϕ ( p j ⋅ i ) = p j ⋅ i × p 1 − 1 p 1 × p 2 − 1 p 2 × ⋅ ⋅ ⋅ × p k − 1 p k × p j − 1 p j \phi({p_j}\cdot i)={p_j}\cdot i\times\frac{p_1-1}{p_1}\times\frac{p_2-1}{p_2}\times\cdot\cdot\cdot\times\frac{p_k-1}{p_k}\times\frac{p_j-1}{p_j} ϕ(pj⋅i)=pj⋅i×p1p1−1×p2p2−1×⋅⋅⋅×pkpk−1×pjpj−1
= p j × ϕ ( i ) × p j − 1 p j ={p_j}\times \phi(i)\times \frac{p_j-1}{p_j} =pj×ϕ(i)×pjpj−1
= ϕ ( i ) × ( p j − 1 ) =\phi(i)\times (p_j-1) =ϕ(i)×(pj−1)
2、代码模板
ll get_eulers(int n) {
phi[1] = 1;
for (int i = 2; i <= n; i++) {
if (!st[i]) {
primes[cnt++] = i;
phi[i] = i - 1;
}
for (int j = 0; primes[j] <= n / i; j++) {
st[primes[j] * i] = true;
if (i % primes[j] == 0) {
phi[primes[j] * i] = primes[j] * phi[i];
break;
}
phi[primes[j] * i] = (primes[j] - 1) * phi[i];
}
}
ll res = 0;
for (int i = 1; i <= n; i++)res += phi[i];
return res;
}
257
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
