(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement:

Consider 3 positive integers, a, b, c. Let [tex]d_{1}[/tex] = gcd(b,c) = 1. Prove that the greatest number dividing all three of a, b, c is gcd([tex]d_{1}[/tex],c)

3. My go at the proof and thoughts:

Well, I know that the common divisors of a and b are precisely the divisors of [tex]d_{1}[/tex]

I also know that to get the gcd(a,b,c) we need to consider a,b's gcd with c to get the overall gcd for all three numbers.

I think that I need to write it as a linear combination for a,b, and c, but I'm stuck. This problem seems easy too, but I think there's something that I'm missing.

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Abstract Algebra

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

**Physics Forums | Science Articles, Homework Help, Discussion**