Let \(n\) be an integer number. Denote by \(\phi(n)\) the number of integers from \(1\) to \(n-1\) coprime with \(n\). Find \(\phi(n)\) for the following cases:
\(n\) is a prime number.
\(n = p^k\) for a prime \(p\).
\(n=pq\) for two different primes \(p\) and \(q\).