小于n且与n互素的整数个数-欧拉phi函数 (ACM学习笔记)

基于欧拉函数推导: α(n) = n(1 - 1/p1)(1 - 1/p2)(1 - 1/p3)…(1 - 1/pk)

int euler_phi_1(int n) {
    int ans = n;
    for (int i = 2; i <= n; i++) {
        if (n % i == 0) ans = ans / i * (i - 1);
        while (n % i == 0) n /= i;
    }
    return ans;
}

OR

int euler_phi_2(int n) {
    int m = (int)sqrt(n + 0.5);
    int ans = n;
    for (int i = 2; i <= m; i++) {
        if (n % i == 0) {
            ans = ans / i * (i - 1);
            while (n % i == 0) n /= i; 
        }
    }
    if (n > 1) ans = ans / n * (n - 1);
    return ans;
}

OR (打表的方法)

int euler_phi_3(int n) {
    memset(vis, 0, sizeof(vis));
    vis[1] = 1;
    for (int i = 2; i <= n; i++) {
        if (!vis[i]) {
            for (int j = i; j <= n; j += i) {
                if (!vis[j]) vis[j] = j;
                vis[j] = vis[j] / i * (i - 1);
            }
        }
    }
    return vis[n];
}