Results 1 to 6 of 6

Math Help - a \not\equiv b (mod m), then b \not\equiv a (mod m)

  1. #1
    MHF Contributor
    Joined
    Mar 2010
    From
    Florida
    Posts
    3,093
    Thanks
    5

    a \not\equiv b (mod m), then b \not\equiv a (mod m)

    a \not\equiv b \  \mbox{(mod m)}, then b \not\equiv a \ \mbox{(mod m)}.

    Is this all there is to this one:

    m\nmid (a-b)\rightarrow mx\neq (-1)(b-a)\rightarrow m(-x)\neq (b-a)\rightarrow m\nmid (b-a)
    Last edited by dwsmith; June 26th 2010 at 06:04 PM.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    A Plied Mathematician
    Joined
    Jun 2010
    From
    CT, USA
    Posts
    6,318
    Thanks
    5
    Awards
    2
    If your other congruence post is logically prior to this one, then it looks good. Otherwise, you should interpose, twice, the intermediate step AsZ showed in the other post. Just for completeness.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    MHF Contributor
    Joined
    Mar 2010
    From
    Florida
    Posts
    3,093
    Thanks
    5
    In the book, it defines m|(a-b) \ \mbox{as} \ a\equiv b \ \mbox{(mod m)}.

    The problem is it justed seemed to easy to be true though.
    Follow Math Help Forum on Facebook and Google+

  4. #4
    A Plied Mathematician
    Joined
    Jun 2010
    From
    CT, USA
    Posts
    6,318
    Thanks
    5
    Awards
    2
    Oh, ok. Different authors define congruence differently, I guess.
    Follow Math Help Forum on Facebook and Google+

  5. #5
    MHF Contributor chiph588@'s Avatar
    Joined
    Sep 2008
    From
    Champaign, Illinois
    Posts
    1,163
    You have the right idea.  m\mid a-b \iff m\mid b-a
    Follow Math Help Forum on Facebook and Google+

  6. #6
    Member
    Joined
    Jun 2010
    From
    Israel
    Posts
    148
    Quote Originally Posted by dwsmith View Post
    a \not\equiv b \  \mbox{(mod m)}, then b \not\equiv a \ \mbox{(mod m)}.

    Is this all there is to this one:

    m\nmid (a-b)\rightarrow mx\neq (-1)(b-a)\rightarrow m(-x)\neq (b-a)\rightarrow m\nmid (b-a)
    If you rephrase this, the problem is: If m does not divide a-b , then also m does not divide b-a .
    Now, a-b and b-a have the same divisors. So if m is not a divisor of a-b , it can't be a divisor of b-a .
    This is essentially the same explantion "chiph588@" gave.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. [SOLVED] if ra\equiv rb (mod m), then a\equiv b (mod \frac{m}{gcd(r,m)})
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: June 15th 2011, 09:04 AM
  2. [SOLVED] Let p be odd. Then 2(p-3)!\equiv -1 (mod p)
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: July 12th 2010, 04:42 PM
  3. Replies: 2
    Last Post: July 10th 2010, 06:14 PM
  4. [SOLVED] 2n^3+3n^2+n\equiv 0 (mod 6)
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: July 9th 2010, 12:44 AM
  5. [SOLVED] if a^2 \equiv 1, then a \equiv \pm 1 (mod p)
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: June 27th 2010, 04:43 PM

/mathhelpforum @mathhelpforum