Let $a,b,c$ be integers, prove that if $\gcd(a,b) =1$ then
$\gcd(ab,c) = \gcd(a,c)\times\gcd(b,c)$
I don't know what to do after I got the combinations of $ab$ and $c$.
Subscribe to:
Post Comments (Atom)
-
So if I have a matrix and I put it into RREF and keep track of the row operations, I can then write it as a product of elementary matrices. ...
-
I am asked to prove the density of irrationals in $\mathbb{R}$. I understand how to do this by proving the density of $\mathbb{Q}$ first, na...
-
Can someone just explain to me the basic process of what is going on here? I understand everything until we start adding 1's then after ...
No comments:
Post a Comment