Results 1 to 2 of 2

Math Help - proof of property of gcd

  1. #1
    Member
    Joined
    Aug 2008
    Posts
    249

    proof of property of gcd

    prove or disprove the following fact: if gcd(b,c) = 1 then gcd(ab,c) = gcd(a, bc).

    i am trying to show that if a number is a common divisor to both a and bc then it must be a common divisor to ab and c. using the fact that bx + cy = 1 for some x and y, i find that if a number is a common divisor to both a and bc then it must be a common divisor to ab as well from the fact that (b)(b)(x)a + (y)(a)bc = ab. what i am having trouble showing is that this number must divide c too.

    i tried a proof by contradiction by saying that this number does not divide c but i couldn't find a contradiction. maybe this fact is untrue? if so, then would the best way to disprove it to find a counterexample? thanks
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Member
    Joined
    Jun 2010
    From
    Israel
    Posts
    148

    Re: proof of property of gcd

    You can show (using Euclid's Lemma) that if gcd(b,c)=1, then gcd(ab,c)=gcd(a,c).

    Counterexample to the original statement: take a=4, b=6, c=5.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Proof of L^2 Norm Property
    Posted in the Differential Geometry Forum
    Replies: 2
    Last Post: August 13th 2010, 02:27 PM
  2. Proof of Topological Property
    Posted in the Differential Geometry Forum
    Replies: 3
    Last Post: February 3rd 2010, 02:18 PM
  3. Fibonacci Property Proof help
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: December 5th 2009, 03:58 PM
  4. dot product property proof help
    Posted in the Calculus Forum
    Replies: 2
    Last Post: July 30th 2008, 06:19 PM
  5. Wronskian property proof
    Posted in the Calculus Forum
    Replies: 0
    Last Post: May 18th 2008, 04:56 PM

Search Tags


/mathhelpforum @mathhelpforum