Friday, January 15, 2016

elementary number theory - Show that for a and b non-zero integers and c different from zero, then gcd(ca,bc) = |c|gcd(a,b)

I did:


$$ca = cb * k + r \Leftrightarrow \\ ca - cb*k = r \\ c(a-bk)=r \\ a-bk = r/c \\ a = bk +r/c$$


So, $gcd(a,b) = r/c$



What do I do next?

No comments:

Post a Comment

analysis - Injection, making bijection

I have injection $f \colon A \rightarrow B$ and I want to get bijection. Can I just resting codomain to $f(A)$? I know that every function i...