Results 1 to 2 of 2

Math Help - Equiv relations

  1. #1
    Newbie
    Joined
    Jan 2009
    Posts
    5

    Equiv relations

    I have no idea how to prove or disprove this statement, can someone help?

    "If n is a positive integer and a,b are elements of Z, then there exists an integer x such that ax=b (mod n)"

    thanks
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Apr 2005
    Posts
    15,536
    Thanks
    1391
    Quote Originally Posted by Bell2009 View Post
    I have no idea how to prove or disprove this statement, can someone help?

    "If n is a positive integer and a,b are elements of Z, then there exists an integer x such that ax=b (mod n)"

    thanks
    Do you know what "mod n" means? Saying ax= b (mod n) means that ax= b+ nk for some integer k. What you are asked to prove (or disprove) is that, for any integers a and b, there exist x so that ax= b+ nk for some integer k. That can be rephrased as "for any integers, a, b, and n, there exist two integers, x and k, so that ax- nk= b. Now, for example, suppose a and n are both even but b is odd. What happens?
    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, 08: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, 03:42 PM
  3. Replies: 2
    Last Post: July 10th 2010, 05:14 PM
  4. [SOLVED] if ab\equiv 0 (mod p), then a\equiv 0 (mod p) or b\equiv 0 (mod p).
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: July 7th 2010, 04:21 PM
  5. Equiv. Relations + Proof!
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: April 18th 2007, 05:17 AM

Search Tags


/mathhelpforum @mathhelpforum