Use Chinese remainder Theorem
http://www.cut-the-knot.org/blue/chinese.shtml
G.C.D of (m,n)=1
1) x ≡3 (mod n)
x ≡2 (mod m)
Find x.
Got it from a frnd.
-
UP 0 DOWN 0 0 6
6 Answers
Arnab Kundu
·2012-01-26 07:00:58
Nana Dubey
·2012-01-26 10:16:59
Hey I never heard of a chinese reminder theorem ..? is it in a chinese menu ? lols..
ok jokes apart do tell me in simple terms
thank you
Arnab Kundu
·2012-01-31 10:17:31
Let integers n-1 and m-1 such that
nn-1≡1(mod m)
mm-1≡1(mod n)
By Chinese Remainder theorem,
x≡2nn-1+3mm-1(mod mn)