Results 1 to 2 of 2

Math Help - Show that gcd (a, m) is less than equal to gcd(a, mn) for any integers a,m and n.?

  1. #1
    Newbie
    Joined
    Oct 2009
    Posts
    24

    Post Show that gcd (a, m) is less than equal to gcd(a, mn) for any integers a,m and n.?

    Show that gcd (a, m) $\leq$ gcd(a, mn) for any integers a,m and n.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor undefined's Avatar
    Joined
    Mar 2010
    From
    Chicago
    Posts
    2,340
    Awards
    1
    Quote Originally Posted by Statsnoob2718 View Post
    Show that gcd (a, m) $\leq$ gcd(a, mn) for any integers a,m and n.
    Sometimes gcd(0,0) is defined as 0 which would provide an exception, but aside form that, show that gcd(a,m) | gcd(a,mn).
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Show 1/x+1 less than or equal to ln(x+1)/x
    Posted in the Differential Geometry Forum
    Replies: 1
    Last Post: November 27th 2011, 11:24 AM
  2. Show two integrals are equal
    Posted in the Calculus Forum
    Replies: 1
    Last Post: April 15th 2011, 02:08 AM
  3. How can I show this is equal to 2sec2x?
    Posted in the Trigonometry Forum
    Replies: 2
    Last Post: April 16th 2010, 02:14 PM
  4. Show sets are equal
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: September 22nd 2009, 05:08 PM
  5. How to show that it's equal (Intergral)
    Posted in the Calculus Forum
    Replies: 2
    Last Post: August 17th 2008, 01:27 AM

Search Tags


/mathhelpforum @mathhelpforum