Euler phi function For n2 1, let (n)denote the number of integers in the interval [1, n which are relatively prime to n. The fu anction phi is called Euler phi function p is a prime then (p=p-1 op is multiplicative. That is if gcd(m, n)=1 then op(m*n=((n) *((m) 2222 Euler phi function • For n ≥ 1, let (n) denote the number of integers in the interval [1, n] which are relatively prime to n. The function phi is called Euler phi function – if p is a prime then (p)=p-1 –  is multiplicative. That is if gcd(m,n)=1 then (m*n)= (n)* (m)