1~n中与n互质的数的个数称为欧拉函数,证明如下:
实现如下:
int eular(int x)
{
int res = x, a = x;
for (int i = 2; i*i <= a; i++) {
if (a%i == 0) {
res = res / i*(i - 1);
while (a%i == 0)
a /= i;
}
}
if (a > 1)
res = res / a*(a - 1);
return res;
}
性质1:1~n中与n互质的数的和为n*eular(n)/2;
性质2:若a,b互质,则eular(a*b)=eular(a)*eular(b);