Given a,b,n are positive integers. If a|n and b|n with gcd(a,b) = 1, prove ab|n
Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
Since gcd(a,b)=1 then there exist g =kh s.t n=abg thus ab|n
why does gcd(a,b) = 1 implies there is an integer g such that g = kh? @ikram002p
Not the answer you are looking for? Search for more explanations.
do u still need help
gcd(a,b)=1 then there is some integers l and s such that al+bs=1
but then we know that a|n: n=ak
from left we can deduce that ba divides it
so must be true for the right too
@xapproachesinfinity Awesome! thank you! Didn't think gcd(a,b) = 1 = al+bs would be used in this case.
didn't understand what ikram did too
i was trying to see through that for awhile
i guess i made mistake it not like g=kh xD that is wrong