Ask
your own question, for FREE!
Mathematics
6 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
Arriyanalol:
@tinydinoUwU stop trying to find a argument u blad lil boy
TinydinoUwU:
**(Verse 1)** Yo, trapped in a box, Iu2019m feelin' so confined, Lifeu2019s a game of chess, but Iu2019m stuck in rewind, Every dayu2019s a struggle, man, I
Arriyanalol:
hey umm so i need help with my lanauage art ixl anybody wanna help big mama
Nina001:
ho where do i go to buy Subscirption for a moving pfp because on my screen im on
1 day ago
5 Replies
4 Medals
17 hours ago
13 Replies
5 Medals
4 days ago
2 Replies
2 Medals
5 days ago
4 Replies
2 Medals