Results 1 to 2 of 2

Thread: Modular

  1. #1
    Junior Member
    Joined
    Jul 2009
    Posts
    25

    Modular

    I have two questions involving mod m that I am struggling with and I was hoping someone could give me some tips on how to start and or complete them

    1. if a = b(mod m) and a = b(mod n), prove a = b(mod mn), I know that m and n are relatively prime. So the greatest common divisor of m and n is 1

    2. If x^2 = a^2 (mod p), prove x= a(mod p) or x = -a (mod p). Where p is a prime..
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor Bruno J.'s Avatar
    Joined
    Jun 2009
    From
    Canada
    Posts
    1,266
    Thanks
    1
    Awards
    1
    For $\displaystyle 1)$, use the definition of congruence, and the fact that if $\displaystyle (m,n)=1$, $\displaystyle m\mid A$ and $\displaystyle n \mid A$ then $\displaystyle mn \mid A$.

    For $\displaystyle 2)$, notice that $\displaystyle x^2-a^2 \equiv 0 \mod p \Rightarrow (x-a)(x-b) \equiv 0 \mod p$. Then use the fact that when $\displaystyle yz \equiv 0 \mod p$ then either $\displaystyle y\equiv 0$ or $\displaystyle z \equiv 0 \mod p$.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Modular Arithmetic
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: Mar 11th 2011, 11:27 AM
  2. Modular arithmetic.
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: Mar 10th 2011, 05:21 PM
  3. Modular Help
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: Oct 11th 2010, 03:40 PM
  4. Modular Inversion
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: Aug 27th 2010, 09:51 PM
  5. Modular help
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: Mar 5th 2007, 11:53 AM

Search Tags


/mathhelpforum @mathhelpforum