20171213, 23:36  #23  
Aug 2002
Buenos Aires, Argentina
2·3^{2}·83 Posts 
Quote:
For example if x1 = 2 (mod m_{r}) and x2 = 3 (mod m_{r}), it is clear that x1 = 2 (mod m) and x2 = 3 (mod m) and these values are a lot less than m_{1} * m_{2} * m_{3} * ... m_{n}. 

20171215, 16:46  #24  
"Forget I exist"
Jul 2009
Dartmouth NS
2×3×23×61 Posts 
Quote:
which can then be restated in the form of a line on the x,y plane. as y1=m1*x+a1; y2=m2*x+a2; y3=m3*x+a3 and looking for common natural number y coordinates amongst them is what CRT is doing. your main problem is you've turned it all into a nonlinear form. edit: and as to your around claim it depends on what's meant by around as 1 pm is close to 12 pm even though 1 is not close to 12. your numeric sort of the positive values is just a sort on the y intercepts of the new lines. Last fiddled with by science_man_88 on 20171215 at 16:51 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Complexity of Chinese Remainder Theorem  carpetpool  Miscellaneous Math  4  20170209 19:26 
Basic Number Theory 6: functions and the Chinese Remainder Theorem  Nick  Number Theory Discussion Group  4  20161031 22:26 
Chinese Remainder Problem  ShiningArcanine  Math  2  20071117 10:01 
Implementing Chinese Remainder Theorem in C  ShiningArcanine  Software  3  20071117 05:55 
Card Sorting Probability  TimSorbet  Math  13  20070113 15:31 