Show that gcd(a, bc)=1 if and only if gcd(a,b)=1 and gcd(a,c)=1 ...
guru2009 (Not rated)
(Not rated)
Show that gcd(a, bc)=1 if and only if gcd(a,b)=1 and gcd(a,c)=1.
If s divides a-b why a mod s = b mod s?
8 years ago
On the contrary, and if possible, let gcd(a, b) = k ...
NOT RATED
Purchase the answer to view it
