Menu Close

Find-the-least-positive-integer-that-leaves-a-remainder-3-when-divided-by-7-4-when-divided-by-9-and-8-when-divided-by-11-




Question Number 133897 by bemath last updated on 25/Feb/21
Find the least positive integer  that leaves a remainder 3 when divided by 7  , 4 when divided by 9 , and 8 when  divided by 11.
Findtheleastpositiveintegerthatleavesaremainder3whendividedby7,4whendividedby9,and8whendividedby11.
Answered by john_santu last updated on 25/Feb/21
by Use Chinese Remainder theorem    determinant ((i,n_i ,N_i ,(y_i N_i ≡1 mod n_1 ),c_i ,(N_i y_i c_i )),(1,7,(9.11),(y_1 .9.11≡1 mod 7→y_1 =1),3,(297)),(2,9,(7.11),(y_2 .7.11≡1 mod 9→y_2 =2),4,(616)),(3,(11),(7.9),(y_3 .7.9≡1 mod 11→y_3 =7),8,(3528)))   X = Σ_i  N_i y_i c_i  = 4441  we have x≡X mod N ⇒x≡ 4441 (mod 693)  x≡ 283 (mod 693) or x = 693k + 283 ; k∈Z  then the least positive integer is x = 283
byUseChineseRemaindertheoreminiNiyiNi1modn1ciNiyici179.11y1.9.111mod7y1=13297297.11y2.7.111mod9y2=246163117.9y3.7.91mod11y3=783528X=iNiyici=4441wehavexXmodNx4441(mod693)x283(mod693)orx=693k+283;kZthentheleastpositiveintegerisx=283
Commented by talminator2856791 last updated on 25/Feb/21
 why is it called chinese remainder theorem?
whyisitcalledchineseremaindertheorem?
Answered by talminator2856791 last updated on 25/Feb/21
 7a+3 = 9b+4 = 11c+8   7a = 9b+1   b = 7k−4      9b+4 = 11c+8   9b = 11c+4   c = 9j−2      9(7k−4) = 11(9j−2)+4   63k−36 = 99j−18   63k = 99j+18   7k = 11j+2   j = 7d−4      9(7k−4) = 11(9(3)−2)+4   63k−36 = 279   63k = 315   k = 5      b = 7k−4   b = 31      9b+4 = 9(31)+4    = 283
7a+3=9b+4=11c+87a=9b+1b=7k49b+4=11c+89b=11c+4c=9j29(7k4)=11(9j2)+463k36=99j1863k=99j+187k=11j+2j=7d49(7k4)=11(9(3)2)+463k36=27963k=315k=5b=7k4b=319b+4=9(31)+4=283

Leave a Reply

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