Menu Close

solve-the-system-of-congruence-x-1-mod-5-x-2-mod-7-x-3-mod-9-x-4-mod-11-




Question Number 66832 by Rio Michael last updated on 20/Aug/19
solve the system of congruence      {: ((x≡ 1 (mod 5))),((x ≡ 2 (mod 7))),((x≡  3(mod 9))),((x ≡ 4( mod 11))) }
solvethesystemofcongruencex1(mod5)x2(mod7)x3(mod9)x4(mod11)}
Answered by mr W last updated on 26/Aug/19
x=5h+1    ...(1)  x=7i+2   ...(2)  x=9j+3   ...(3)  x=11k+4   ...(4)    x=11k+4=(11k+1)+3=^(!) 9j+3  ⇒11k+1=9j  ⇒9j−11k=1  ⇒j=11m+5   ^(∗∗))   ⇒k=9m+4    x=9(11m+5)+3=(99m+46)+2=^(!) 7i+2  ⇒99m+46=7i  ⇒7i−99m=46  ⇒i=99l+49   ^(∗∗))   ⇒m=7l+3    x=7(99l+49)+2=(693l+344)+1=^(!) 5h+1  ⇒693l+344=5h  ⇒5h−693l=344  ⇒h=693n+346   ^(∗∗))   ⇒l=5n+2    x=5(693n+346)+1=3465n+1731    ⇒general solution is  x=3465n+1731 with n=0,1,2,3,....
x=5h+1(1)x=7i+2(2)x=9j+3(3)x=11k+4(4)x=11k+4=(11k+1)+3=!9j+311k+1=9j9j11k=1j=11m+5)k=9m+4x=9(11m+5)+3=(99m+46)+2=!7i+299m+46=7i7i99m=46i=99l+49)m=7l+3x=7(99l+49)+2=(693l+344)+1=!5h+1693l+344=5h5h693l=344h=693n+346)l=5n+2x=5(693n+346)+1=3465n+1731generalsolutionisx=3465n+1731withn=0,1,2,3,.
Commented by mr W last updated on 21/Aug/19
are there any easier and more direct  ways to solve?    to understand ^(∗∗))  in my solution  see also my explanation in Q19198.
arethereanyeasierandmoredirectwaystosolve?tounderstand)inmysolutionseealsomyexplanationinQ19198.
Commented by Rio Michael last updated on 21/Aug/19
okay sir l′ll check but thanks for this
okaysirlllcheckbutthanksforthis
Commented by Rasheed.Sindhi last updated on 22/Aug/19
Sir mr W, I think it can be solved  by ′Chinese remainder theorm′,but  unfortinuately at the moment I′ve forgotten it.
SirmrW,IthinkitcanbesolvedbyChineseremaindertheorm,butunfortinuatelyatthemomentIveforgottenit.
Commented by Prithwish sen last updated on 22/Aug/19
By chinese remainder theorem  ∵ 5,7,9,11 are pairwise prime  let m = 5.7.9.11 = 3465  ∴ M_1 =(m/5) = 693, M_2 = (m/7) = 495, M_3  = (m/9) = 385  M_4 =(m/(11)) = 315  gcd(693,5)=1 ⇒693u+5v=1⇒u=2 v=−277  ∴693x≡1(mod5)has unique soln. x≡2(mod5)  gcd(495,7)=1⇒495u+7v=1⇒u=3 v=−212  ∴495x≡1(mod7)has unique soln. x≡3(mod7)  gcd(385,9)=1⇒385u+9v=1⇒u=4 v=−171  ∴385x≡1(mod9)has unique soln.x≡4(mod9)  gcd(315,11)=1⇒315u+11v=1⇒u=−3 v=86  ∴315x≡1(mod11)has unique soln.x≡−3(mod11)  i.e x≡8(mod11)  ∴ x_0 = 1.(693.2)+2.(495.3)+3.(385.4)+4.(315.8)            = 19056  ∴ The soln. is x ≡ 19056 (mod 3465)                       i.e x ≡ 1731 (mod 3465)
Bychineseremaindertheorem5,7,9,11arepairwiseprimeletm=5.7.9.11=3465M1=m5=693,M2=m7=495,M3=m9=385M4=m11=315gcd(693,5)=1693u+5v=1u=2v=277693x1(mod5)hasuniquesoln.x2(mod5)gcd(495,7)=1495u+7v=1u=3v=212495x1(mod7)hasuniquesoln.x3(mod7)gcd(385,9)=1385u+9v=1u=4v=171385x1(mod9)hasuniquesoln.x4(mod9)gcd(315,11)=1315u+11v=1u=3v=86315x1(mod11)hasuniquesoln.x3(mod11)i.ex8(mod11)x0=1.(693.2)+2.(495.3)+3.(385.4)+4.(315.8)=19056Thesoln.isx19056(mod3465)i.ex1731(mod3465)
Commented by mr W last updated on 22/Aug/19
thank you for your effort sir!
thankyouforyoureffortsir!
Commented by Prithwish sen last updated on 23/Aug/19
you are welcome sir.
youarewelcomesir.
Commented by Rio Michael last updated on 25/Aug/19
thanks alot you all, i really want to learn this part of mathematics, how do i go  about it? please help me.
thanksalotyouall,ireallywanttolearnthispartofmathematics,howdoigoaboutit?pleasehelpme.
Commented by mr W last updated on 25/Aug/19
at first please try not to write  endless long rows in your posts sir.  usually i ignore posts if i must  scroll horizontally when i read  them.  back to your question, if you want  to learn “chinese remainder” method,  i can not help you. please refer to  Wikipedia for more details. if  you want to learn about my method,  try to understand  how to solve  ax+by=c as i explained in question  No 19198.
atfirstpleasetrynottowriteendlesslongrowsinyourpostssir.usuallyiignorepostsifimustscrollhorizontallywhenireadthem.backtoyourquestion,ifyouwanttolearnchineseremaindermethod,icannothelpyou.pleaserefertoWikipediaformoredetails.ifyouwanttolearnaboutmymethod,trytounderstandhowtosolveax+by=casiexplainedinquestionNo19198.
Commented by Rio Michael last updated on 29/Aug/19
yes i know how to solve linear diophantine equations
yesiknowhowtosolvelineardiophantineequations
Commented by Rio Michael last updated on 29/Aug/19
i′ll visit wikipedia
illvisitwikipedia
Answered by Rasheed.Sindhi last updated on 22/Aug/19
               An Arithmetic Way      {: ((x≡ 1 (mod 5) ...(i))),((x ≡ 2 (mod 7)....(ii))),((x≡  3(mod 9).....(iii))),((x ≡ 4( mod 11)...(iv))) }   (i)⇒x=6,11,16,21,...  Each number can be obtained by   adding 5 in previous.  We can see that 16 is also solution of  (ii)(....mod 7)   Any other such number(which is common  solution to (i) & (ii)) will be 35 (lcm of  5 &7)  greater than 16...  16,51,86,121,156,...  156 is also solution of (iii) (...mod 9)  So next such solution is 315( lcm(5,7,9) )  greater than 156  156,471,786,1101,1416,1731  1731 is also solution of (iv)(....mod 11)  Next such number is greater by any  multiple of lcm(5,7,9,11)=3465.  1731,5196,8661,...
AnArithmeticWayx1(mod5)(i)x2(mod7).(ii)x3(mod9)..(iii)x4(mod11)(iv)}(i)x=6,11,16,21,Eachnumbercanbeobtainedbyadding5inprevious.Wecanseethat16isalsosolutionof(ii)(.mod7)Anyothersuchnumber(whichiscommonsolutionto(i)&(ii))willbe35(lcmof5&7)greaterthan1616,51,86,121,156,156isalsosolutionof(iii)(mod9)Sonextsuchsolutionis315(lcm(5,7,9))greaterthan156156,471,786,1101,1416,17311731isalsosolutionof(iv)(.mod11)Nextsuchnumberisgreaterbyanymultipleoflcm(5,7,9,11)=3465.1731,5196,8661,
Commented by Rasheed.Sindhi last updated on 22/Aug/19
Sir mr W     I had solved the above problem in   that way sometime ago(At that time I didn′t know  chinese remainder theorm.)The above  method didn′t use algebra..and it′s  my own method.
SirmrWIhadsolvedtheaboveprobleminthatwaysometimeago(AtthattimeIdidntknowchineseremaindertheorm.)Theabovemethoddidntusealgebra..anditsmyownmethod.
Commented by mr W last updated on 22/Aug/19
Sir Rasheed,   thank you very much for this new  way! i appreciate it!
SirRasheed,thankyouverymuchforthisnewway!iappreciateit!
Commented by Rasheed.Sindhi last updated on 22/Aug/19
Thanks A Lot Sir!
ThanksALotSir!

Leave a Reply

Your email address will not be published. Required fields are marked *