eva12
  • eva12
1. if a divides b and a divides c then a divides gcd(b,c). help so far I have this proof: assume a/b and a/c so a=bp and a=cq for some p and q an element of an integer........
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
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.
katieb
  • katieb
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
mainly you wanna prove that any common divisor d of b and c is less than or equal gcd(b,c) and also d|gcd(b,c)
anonymous
  • anonymous
which is already in gcd definition see this post. http://openstudy.com/study#/updates/55eac022e4b0819646d98287

Looking for something else?

Not the answer you are looking for? Search for more explanations.