Let \(\phi(n)\) be the Euler’s function, namely the amount of numbers from \(1\) to \(n\), coprime with \(n\). For two natural numbers \(m,n\) such that \(\mathbb{GCD}(m,n)=1\) prove that \(\phi(mn) = \phi(m)\phi(n)\).