1. Limited time only! Sign up for a free 30min personal 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!

Basic Number theory question:

  1. Sep 23, 2010 #1
    1. The problem statement, all variables and given/known data

    Prove that for two integers m,n: all the common divisors divides the g.c.d.(m,n).

    2. Relevant equations



    3. The attempt at a solution

    g.c.d = aA +bB ; where a, b are the integers

    and let d be a common divisor, then:
    d|a and d|b.

    After this I have no clue where to go.
    1. The problem statement, all variables and given/known data



    2. Relevant equations



    3. The attempt at a solution
     
  2. jcsd
  3. Sep 23, 2010 #2
    Do you know the formula for gcd involving lcm? Try using that.
     
  4. Sep 23, 2010 #3
    u can even try having a look at how gcd of 2 numbers is obtained http://en.wikipedia.org/wiki/Euclidean_algorithm" [Broken]
     
    Last edited by a moderator: May 4, 2017
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Basic Number theory question:
Loading...