Results 1 to 2 of 2

Math Help - modular arithmetic proof

  1. #1
    Junior Member
    Joined
    Jan 2010
    Posts
    29

    modular arithmetic proof

    let n=pq where p,q are distinct positive odd prime numbers.let [a] be a fixed non zero element in Zn. How many distinct solutions are there in Zn to the equation: [a][x]=[1]?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Banned
    Joined
    Oct 2009
    Posts
    4,261
    Thanks
    2
    Quote Originally Posted by Deepu View Post
    let n=pq where p,q are distinct positive odd prime numbers.let [a] be a fixed non zero element in Zn. How many distinct solutions are there in Zn to the equation: [a][x]=[1]?

    Either none or exactly one. Think of this, try to work out a proof and, after this, if you're stuck somewhere then write back.

    Tonio
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Modular arithmetic
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: March 21st 2011, 04:40 AM
  2. Modular Arithmetic
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: March 11th 2011, 12:27 PM
  3. Modular Arithmetic
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: September 19th 2010, 03:47 AM
  4. Modular arithmetic
    Posted in the Number Theory Forum
    Replies: 6
    Last Post: June 29th 2010, 08:51 PM
  5. Proof Using Modular Arithmetic
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: October 19th 2009, 12:11 AM

Search Tags


/mathhelpforum @mathhelpforum