Hi all, Prove that if gcd(a,m) = gcd(b,m) = 1 then gcd(ab,m) = 1.
Follow Math Help Forum on Facebook and Google+
Originally Posted by sirellwood Hi all, Prove that if gcd(a,m) = gcd(b,m) = 1 then gcd(ab,m) = 1. Suppose there's a prime p s.t. p divides ab and m ==> (p divides a or p divides b) and (p divides m) ==>.... Tonio
I see where you are going! thanks!
View Tag Cloud