I have this math question that I am kind of stuck on.
Show that if $\gcd(m_1,m_2) = 1$ and $n$ is an integer with $m_1\mid n$ and $m_2\mid n$, then $m_1m_2\mid n$, using unique factorization.
I'm not 100% how to start this. I already proved this using Bezout's identity. Thanks