Question: given: gcd(x,y) + gcd(x,z) + gcd(y,z) = y + z + 920 with x,y,z being positive integers prove that gcd(b,c)=920

[stephanson12]

given: gcd(x,y) + gcd(x,z) + gcd(y,z) = y + z + 920
with x,y,z being positive integers

prove that gcd(b,c)=920

Can someone solve this?

 

[stapel]

given: gcd(x,y) + gcd(x,z) + gcd(y,z) = y + z + 920
with x,y,z being positive integers

prove that gcd(b,c)=920

Can someone solve this?

Yes, probably somebody *can* solve this. But the point is to get you to where *you* can solve it!

So please reply with a clear listing of your thoughts and efforts so far, so we can see where things are going sideways. ("Read Before Posting")

Thank you!

 

[Dr.Peterson]

given: gcd(x,y) + gcd(x,z) + gcd(y,z) = y + z + 920
with x,y,z being positive integers

prove that gcd(b,c)=920

Can someone solve this?

No, I don't think anyone can. You didn't say what b and c are!

Where's the typo?

 

[stephanson12]

given: gcd(x,y) + gcd(x,z) + gcd(y,z) = y + z + 920
with x,y,z being positive integers

prove that gcd(b,c)=920

Can someone solve this?

sorry,
it needs to be the nect:

given: gcd(x,y) + gcd(x,z) + gcd(y,z) = x + y + 920
with x,y,z being positive integers

prove that gcd(x,y)=920

 

[Dr.Peterson]

sorry,
it needs to be the nect:

given: gcd(x,y) + gcd(x,z) + gcd(y,z) = x + y + 920
with x,y,z being positive integers

prove that gcd(x,y)=920

Please reread #2, and act on it. What have you tried? What theorems might apply? We want to work with you, not in place of you.