Write a program to compute φ(n), the value of Euler’s phi function. You should compute φ(n) by using a factorization of n into primes, not by finding all the a’s between 1 and n that are relatively prime to n.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.