A community for students.
Here's the question you clicked on:
← 55 members online
 0 viewing
eva12
 one year ago
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........
eva12
 one year ago
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........

This Question is Closed

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0mainly you wanna prove that any common divisor d of b and c is less than or equal gcd(b,c) and also dgcd(b,c)

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0which is already in gcd definition see this post. http://openstudy.com/study#/updates/55eac022e4b0819646d98287
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.