Euler Totient Function(Euler phi function f(n) )

• f(n) = number of positive integers less than n that are relatively prime to n (n > 1).

• If n is prime, f(n) =

• If n = pq, where p and q are prime,

f(n) =

Previous slide

Next slide

Back to first slide

View graphic version