Q for X

G.C.D of (m,n)=1

1) x ≡3 (mod n)
x ≡2 (mod m)

Find x.

Got it from a frnd.

6 Answers

21
Arnab Kundu ·

Use Chinese remainder Theorem
http://www.cut-the-knot.org/blue/chinese.shtml

1
Nana Dubey ·

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

21
Arnab Kundu ·

Folow the link please to get the answers to your questions

7
Sigma ·

Well, this q was asked in The kvpy interview to a cls 11 student.

7
Sigma ·

@ Arnab, i can't get the ans.. can u give this sum a try?

21
Arnab Kundu ·

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)

Your Answer

Close [X]