If $a,b,c\in\mathbb Z$, then show that $c\cdot\gcd(a,b)\le\gcd(ac,bc)$.
My try: we know that $\gcd(ca,cb)=c\cdot \gcd(a,b)$, but here I don't know what to do.
If $a,b,c\in\mathbb Z$, then show that $c\cdot\gcd(a,b)\le\gcd(ac,bc)$.
My try: we know that $\gcd(ca,cb)=c\cdot \gcd(a,b)$, but here I don't know what to do.
Copyright © 2021 JogjaFile Inc.
You're wrong when you say $gcd(ac,bc)=c\cdot gcd(a,b)$. The correct equation is $gcd(ac,bc)=|c|\cdot gcd(a,b)$. Do you know how to prove this equation (hint: prime factorization)? From this equation the theorem follows immediately because $c\leq |c|$ holds for all $c\in\mathbb{Z}$