Ask your own question, for FREE!
Mathematics 7 Online
OpenStudy (anonymous):

help please 1/ Let a ∈Z, a not equals 0. prove gcd(a,0) = |a|. 2/ For a,b ∈Z (not both 0). prove gcd(a,b) = gcd(b,a).

OpenStudy (freckles):

For the first one shouldn't it be enough to say a=|a|*sign(a) and 0=|a|*0 sign(a) can be -1 or 1 recall the definition of gcd(a,b) is max{d : d|a and d|b} and |a|>0 so gcd(a,0) is |a|.... I don't see much to prove honestly. :( and for the second one I think you would just need to prove an and statement is commutative for example show A and B is the same as B and A since the def of gcd(a,b) is max{d: d|a and d|b}

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Latest Questions
Arriyanalol: i need help
2 days ago 7 Replies 1 Medal
Arriyanalol: CONGRATS to me
2 days ago 8 Replies 2 Medals
Legomaster346: What colleges are good that are near Arab Alabama?
1 week ago 5 Replies 0 Medals
Arriyanalol: i need help
1 week ago 6 Replies 2 Medals
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!