Results 1 to 2 of 2

Thread: Show that is gcd(a,b)=1, and both a and b divide c, then ab divides c.

  1. February 23rd 2010, 12:29 PM #1
    feyomi
    feyomi is offline
    Junior Member
    Joined
    Jan 2010
    Posts
    50

    Show that is gcd(a,b)=1, and both a and b divide c, then ab divides c.

    Show that if gcd(a,b)=1, and both a and b divide c, then ab divides c.
    Follow Math Help Forum on Facebook and Google+
  2. February 23rd 2010, 12:36 PM #2
    icemanfan
    icemanfan is offline
    MHF Contributor
    Joined
    Apr 2008
    Posts
    1,092
    Use the Fundamental Theorem of Arithmetic and the fact that if gcd(a,b) = 1, then a and b share no common prime factors.
    Follow Math Help Forum on Facebook and Google+
« Prove that √15 is irrational. | Prove that (√2)^(√2) is irrational (assuming that √2 is irrational). »

Similar Math Help Forum Discussions

  1. If r divides xy and s divides xy but gcd(r,s) =1: show that r divides xy/s
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: October 8th 2011, 04:16 PM
  2. Show that 3 divides n if and only if 3 divides (am+am-1+...+a2+a1+a0).
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: May 1st 2011, 02:11 PM
  3. In Z[i], show that 1+i divides...
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: April 21st 2010, 02:37 PM
  4. Show that if m > n then ((a^2)^n) + 1 divides ((a^2)^n)− 1
    Posted in the Number Theory Forum
    Replies: 7
    Last Post: November 7th 2009, 04:05 AM
  5. Show that n planes divide the space into...?
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: May 28th 2009, 10:09 AM

Search Tags


/mathhelpforum @mathhelpforum