Greatest common divisor of two multiples of prime numbers

31 Views Asked by At

Let $m \in \mathbb{Z}^+$ and let $m = p_1^{e_1}p_2^{e_2}...p_{k-1}^{e_{k-1}}p_k^{e_k}$ by unique prime factorization, where $p_i$ is distinct. Why is it true that $gcd(p_i^{e_i}, p_j^{e_j}) = 1$ for $i \neq j$?