For , with and are prime numbers
1) show that if d does not equal m and d is a divisor of m then phi(d) divides phi(m).
2)show that for any positive integer m and n, phi(m)*phi(n)=phi(gcd(m,n))*phi(lcm(m,n)).
I just don't know where to begin so a push in the right direction would be greatly appreciated.