Show that if $\gcd(b,c) = 1$ then $\gcd(a,bc) = \gcd(a,b)\gcd(a,c).$
Everyone, I'm stuck on this proof. I know that: $$\gcd(a,bc)=\gcd(a,b)\cdot\gcd(a,c)\gcd(a,bc)\\=\gcd(a,b)\cdot\gcd(a,c),$$ but I don't know how I use $\gcd(b,c)=1$ to get that $\gcd(a,bc)=\gcd(a,b)\cdot\gcd(a,c)$
Let $a=p_1^{\alpha_1}p_2^{\alpha_2}...p_n^{\alpha_n}$, $b=p_1^{\beta_1}p_2^{\beta_2}...p_n^{\beta_n}$ and $c=p_1^{\gamma_1}p_2^{\gamma_2}...p_n^{\gamma_n}$,
where $p_i$ are different primes and $\alpha_1\geq0$, $\beta_i\geq0$ and $\gamma_i\geq0$ are integer numbers.
Thus, we need to prove that $$\min\{\alpha_i,\beta_i+\gamma_i\}=\min\{\alpha_i,\beta_i\}+\min\{\alpha_i,\gamma_i\},$$ which is obvious because $\beta_i\gamma_i=0$.