Results 1 to 2 of 2

Math Help - Euclidean Algorithm & Chinese Remainder Theroem

  1. #1
    Junior Member
    Joined
    Oct 2009
    Posts
    31

    Euclidean Algorithm & Chinese Remainder Theroem

    Hey all ive been attempting this question and ive become a bit stuck.

    Heres the question.



    Heres my solution

    (i) GCD=1

    (ii) x = 7 , y = -29

    (iii) Do i just set A = 7 & B = -29, and thats it?

    (iv) x == 112 x (7) x 2 + 27 x (-29) x 4
    == -1564 mod 112,27

    Is this all correct?

    Thanks all!
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member roninpro's Avatar
    Joined
    Nov 2009
    Posts
    485
    Maybe I'm just going blind, but I don't see the question.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 1
    Last Post: December 21st 2011, 03:24 AM
  2. Chinese Remainder Thm
    Posted in the Number Theory Forum
    Replies: 8
    Last Post: April 8th 2010, 12:37 PM
  3. Chinese Remainder Theorem
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: February 25th 2010, 07:56 PM
  4. chinese remainder
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: October 29th 2008, 09:20 AM
  5. chinese remainder theorem
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: May 29th 2008, 02:20 PM

Search Tags


/mathhelpforum @mathhelpforum