Results 1 to 2 of 2

Math Help - Chinese remainder theorem problem

  1. #1
    Member
    Joined
    Sep 2010
    From
    Germany
    Posts
    112
    Thanks
    4

    Chinese remainder theorem problem

    [latex]\begin{cases}
    x \equiv 39 \pmod{189}\\
    x \equiv 25 \pmod{539}\\
    x \equiv 39 \pmod{1089}\end{cases}[/latex]

    but two moduli are not pairwise prime [latex](189, 1089)=3[/latex]
    What do we do to solve it then? Should we write prime decomposition for these moduli and calculate it separately?

    Thanks
    Last edited by rayman; July 5th 2014 at 11:49 PM.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Member
    Joined
    Sep 2010
    From
    Germany
    Posts
    112
    Thanks
    4

    Re: Chinese remainder theorem problem

    I have solve it.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Chinese remainder theorem problem
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: April 1st 2012, 08:03 AM
  2. Basic Chinese Remainder Theorem Problem
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: May 22nd 2010, 10:27 AM
  3. Chinese Remainder Theorem Problem
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: December 21st 2009, 02:49 PM
  4. Chinese Remainder Theorem
    Posted in the Number Theory Forum
    Replies: 8
    Last Post: July 31st 2009, 08:34 AM
  5. Chinese Remainder Theorem 3
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: March 27th 2007, 12:27 PM

Search Tags


/mathhelpforum @mathhelpforum