Results 1 to 7 of 7

Math Help - GCD and least common multiple problem -02

  1. #1
    Junior Member
    Joined
    Nov 2009
    Posts
    38

    GCD and least common multiple problem -02

    Please help me to Show that
    i. a = b(mod m)=> (a,m) = (b,m)
    ii. a = b(mod m)=> a^n = b^n (mod m)
    iii. ak=bk(mod m)=> b{mod[m/(k,m)]}
    Attached Thumbnails Attached Thumbnails GCD and least common multiple problem -02-l4-des-q02-b.jpg  
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Super Member
    Joined
    Apr 2009
    Posts
    678
    Thanks
    1
    Quote Originally Posted by dhammikai View Post
    Please help me to Show that
    i. a = b(mod m)=> (a,m) = (b,m)
    ii. a = b(mod m)=> a^n = b^n (mod m)
    iii. ak=bk(mod m)=> b{mod[m/(k,m)]}
    Can we see where are you stuck here exactly plz?
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Junior Member
    Joined
    Nov 2009
    Posts
    38
    I am trying to solve this form following please see, but i am stuck with how I implement it
    Attached Thumbnails Attached Thumbnails GCD and least common multiple problem -02-l4-des-q02-b-new.jpg  
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Super Member
    Joined
    Apr 2009
    Posts
    678
    Thanks
    1
    Quote Originally Posted by dhammikai View Post
    I am trying to solve this form following please see, but i am stuck with how I implement it
    Plz avoid images as much as possible. At times you just don't feel like clicking and opening them.

    Why don't you start. So. let's see some working for (1).
    I will give you a hint if x|y and y|x => x=y.
    Follow Math Help Forum on Facebook and Google+

  5. #5
    Senior Member Shanks's Avatar
    Joined
    Nov 2009
    From
    BeiJing
    Posts
    374
    (i) is talking about the Euclidean Algorithem.
    (ii) and (iii) are talking about the property of congruence concernning the power and division operation.
    So just follow the definition and the hint, you will get closer to the conclusion.
    Follow Math Help Forum on Facebook and Google+

  6. #6
    Junior Member
    Joined
    Nov 2009
    Posts
    38
    1.) a = b(mod m)=> (a,m) = (b,m)

    "Why don't you start. So. let's see some working for (1).
    I will give you a hint if x|y and y|x => x=y."

    then,
    If x = y (mod m) then y = x+sm for some s,

    is true?
    Follow Math Help Forum on Facebook and Google+

  7. #7
    Super Member
    Joined
    Apr 2009
    Posts
    678
    Thanks
    1
    Quote Originally Posted by dhammikai View Post
    1.) a = b(mod m)=> (a,m) = (b,m)

    "Why don't you start. So. let's see some working for (1).
    I will give you a hint if x|y and y|x => x=y."

    then,
    If x = y (mod m) then y = x+sm for some s,

    is true?
    yes, more exactly (x-y)=sm
    but you have just stated the definition of the congruence relation
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 2
    Last Post: January 25th 2011, 05:38 AM
  2. [SOLVED] Least common multiple - Greatest common divisor
    Posted in the Number Theory Forum
    Replies: 6
    Last Post: October 25th 2010, 06:45 AM
  3. Least common multiple of multiple numbers
    Posted in the Number Theory Forum
    Replies: 0
    Last Post: December 7th 2009, 10:18 PM
  4. GCD and least common multiple Problem
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: November 26th 2009, 11:48 PM
  5. Replies: 2
    Last Post: March 14th 2009, 04:56 AM

Search Tags


/mathhelpforum @mathhelpforum