Ask
your own question, for FREE!
Mathematics
9 Online
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).
Still Need Help?
Join the QuestionCove community and study together with friends!
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!
Join our real-time social learning platform and learn together with your friends!
Latest Questions
abby2blessed:
How do you guys feel about second chances? Concerning relationships, both romantic and otherwise.
TJH:
love Love, it comes, it goes But what if it stayed stayed in the silence the storm stayed when the world was loud for me it's different; it left when it was
Puffer:
General question what came first the chicken or the egg itu2019s a trick question
Bounty:
the world keeps moving fast and I'm stuck in a time lapse all I need is a minute
Bounty:
can I get so tips on how to start my journey into semi-realism art also on how to
Strawberryluna:
Read my poem. Im not for criticism its a poem I wrote after my breakup: Youu2019ll never understand the way you made me break, I hate that I still love you
4 days ago
0 Replies
0 Medals
4 days ago
4 Replies
3 Medals
4 days ago
5 Replies
1 Medal
1 week ago
4 Replies
0 Medals
2 weeks ago
0 Replies
0 Medals
5 days ago
5 Replies
2 Medals