Euler phi-function Euler (p function o(n)=(0<b<n)gcd (b, n )=1) If p is prime than (p)=p-1 op(m*n)=((m)*o(n), if g c. d (m, n)=1 Q(p0)=p-p1Euler phi-function • Euler  function – (n) = | (0b<n) | g.c.d.(b,n) = 1) | – If p is prime than (p) = p-1 – (m*n) = (m)* (n), if g.c.d.(m,n) = 1 – (p)=p - p -1