Given that d|n, show that phi(d)|phi(n) if n is a power of a prime. If n=p^k, then phi(n)=p^k-p^(k-1), but I can't make the leap to showing divisibility. Help, please!
Given that d|n, show that phi(d)|phi(n) if n is a power of a prime. If n=p^k, then phi(n)=p^k-p^(k-1), but I can't make the leap to showing divisibility. Help, please!