Number of Proper Fractions with Denominator d

If n is the numerator and d the denominator of a fraction, that fraction is defined a (reduced) proper fraction if and only if GCD(n,d)==1.

For example 5/16 is a proper fraction, while 6/16 is not, as both 6 and 16 are divisible by 2, thus the fraction can be reduced to 3/8.

Now, if you consider a given number d, how many proper fractions can be built using d as a denominator?

For example, let's assume that d is 15: you can build a total of 8 different proper fractions between 0 and 1 with it: 1/15, 2/15, 4/15, 7/15, 8/15, 11/15, 13/15 and 14/15.

You are to build a function that computes how many proper fractions you can build with a given denominator:

proper_fractions(1)==0
proper_fractions(2)==1
proper_fractions(5)==4
proper_fractions(15)==8
proper_fractions(25)==20

Be ready to handle big numbers.

Edit: to be extra precise, the term should be "reduced" fractions, thanks to girianshiido for pointing this out and sorry for the use of an improper word :)

自己刚刚开始是暴利求解，发现复杂度太高了，不行，最后网上一查 才知道有欧拉函数的存在

对正整数n，欧拉函数是少于或等于n的数中与n互质的数的数目

public class ProperFractions {
    public static long properFractions(long n) {
        // good luck

        if (n==1) return 0;
        long res=n,a=n;
        for (long i=2;i<=Math.sqrt(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;


    }
}

 

了解欧拉函数可以查看

浅谈欧拉函数

 

欧拉函数

https://blog.csdn.net/sentimental_dog/article/details/52002608