+179 Find the least positive four-digit solution to the following system of congruences.
7x≡21(mod14)2x+13≡16(mod9)−2x+1≡x(mod25)
The 3 congruences can be re-written as follows:
x mod 2 =1,
x mod 9 =6,
x mod 25 =17, solve for x
Using CRT plus MMI
i=0;j=0;m=0;t=0;a=(2, 9, 25);r= (1, 6, 17);c=lcm(a); d=c / a[i];n=d % a[i] ;loop1:m++; if(n*m % a[i] ==1, goto loop, goto loop1);loop:s=(c/a[i]*r[j]*m);i++;j++;t=t+s;m=0;if(i< count a, goto4,m=m);printc,"m + ",t % c;return
x =450m + 267, where m=0, 1, 2, 3.........etc.
x =(450 x 2) + 267
x =1167 - This is the least 4-digit solution.
