1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Help with a proof

  1. Jan 27, 2008 #1
    Hi there can someone help me on this one:
    If gcd(a,b)=1 then gcd(a,bk) = gcd(a,k)

    I have arrived at the conclusion that gcd(a,bk) gcd(a,k) both divide k but from here I do not get anywhere.

    I would like some hints on this please.
  2. jcsd
  3. Jan 28, 2008 #2
    Hi, I think it is sufficient to prove that gcd(a,bk) and gcd(a,b) divide each other.
  4. Jan 28, 2008 #3
    could be that they both equal 1, for instance if k = b but think of expressing both a and k in the form of a product of primes. Since the gcd(a,k) is the product of the prime factors that are common to a and k or 1 if there are no common factors other than 1, and gcd(a,b), which is the product of the prime factors that are common to b and a, is 1, does k*b add any other factors of a?
    Last edited: Jan 28, 2008
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?

Similar Discussions: Help with a proof
  1. Proof help (Replies: 4)

  2. Help with proof (Replies: 1)

  3. Help with a proof (Replies: 3)

  4. Help with a proof (Replies: 2)

  5. Help with a proof. (Replies: 5)