anonymous
  • anonymous
solve the following system. \[2x\equiv 3 (mod 5)\] \[4x\equiv 2 (mod 6)\] \[3x\equiv 2 (mod 7)\]
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
schrodinger
  • schrodinger
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
ganeshie8
  • ganeshie8
familiar with chinese remainder theorem ?
IrishBoy123
  • IrishBoy123
.
anonymous
  • anonymous
I have done an assignment but it only had something like \[x\equiv 3 (mod 5)\] \[x\equiv 2 (mod 6)\] \[x\equiv 2 (mod 7)\]. But am not sure how to use it to solve the problem. @ganeshie8

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

ganeshie8
  • ganeshie8
solve each of the linear congruence to get a system with simpler congruences, for example : \(2x\equiv 3 \pmod 5\) simplifies to \(x\equiv 4\pmod{5}\)
anonymous
  • anonymous
@ganeshie8 Please show me a step on how you got the 4
ganeshie8
  • ganeshie8
I have just guessed it. Plugin x=4 and observe that it satisfies the congruence \[2*4\equiv 8\equiv 3\pmod{5}\]
anonymous
  • anonymous
@ganeshie8 Thanks. I will try doing that and then apply the Chinese remainder theorem
ganeshie8
  • ganeshie8
For the second congruence, \(4x\equiv 2 \pmod 6\), dividing \(2\) through out gives \[2x\equiv 1\pmod{3}\] then it is easy to eyeball the solution : \[x\equiv 2\pmod{3}\]
anonymous
  • anonymous
\[3x\equiv 2 (mod 7)\] simplifues to \[x\equiv -4 (mod 7)\] Does that look correct? @ganeshie8
anonymous
  • anonymous
Probably \[x\equiv 10 (mod 7)\]
ganeshie8
  • ganeshie8
\(x\equiv -4\pmod{7}\) is same as \(x\equiv 3 \pmod{7}\)
ganeshie8
  • ganeshie8
so the given system, after transforming into simple linear congruences is \[x\equiv 4\pmod{5}\\x\equiv 2\pmod{3}\\x\equiv 3\pmod{7}\]
anonymous
  • anonymous
I got it. Thanks alot @ganeshie8

Looking for something else?

Not the answer you are looking for? Search for more explanations.