GCD Associativity: Proving gcd(a,b,c) with Linear Combinations

  • Thread starter Thread starter lordy12
  • Start date Start date
  • Tags Tags
    Gcd
lordy12
Messages
36
Reaction score
0
1.Show gcd(a,b,c) = gcd(a, gcd(b,c))



Homework Equations





3. My attempt is that gcd(a,b,c) can be written as the product of their prime factors. Let's say x is that product. The thing is, I know how to prove this using prime factorization but there has to be another method concerning linear combinations. Like gcd(a,b,c) = ax + by+ cz.
 
Physics news on Phys.org
Why not just say a= nx, b= ny, c= nz where n= gcd(a,b,c).
Of course, you also have b= mp, c= mq where m= gcd(b,c).
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top