Prove: if a|b and a>0, then (a,b)=a
(a,b) stands for gcd(a,b), correct? What is the definition you're given of gcd? I just want to make sure it matches the one I'm using.
yes
gcd(a,b) means d|a and d|b
if a divide b (a|b) , a is a multiple of b, so you can write a = cb (c time b) where c is a constant., from there you can conclude that gcd(a,b) = a
in this case your d = cb = a
instead of a = cb.. shouldn't it be b = ac since a|b?
how about the fact that a>0?
i am not familiar with the notation a|b ...read a divide b...if a is larger then a = cb, if b is larger then b = ca ..., one of those is right...because i learned maths from a country different than the US
a divides b means b is the larger one.. so b = ac
ok so b = ac , so gcd(a,b) = gcd(a,ac) = a , right? , i don't know why is the condition a > 0, for me, i would think condition is a not equal to zero since a is in the denominator, it can't be zero...
yeah you're right..
thank you so much
np, enjoy :)
Join our real-time social learning platform and learn together with your friends!