Find the smallest whole number that, when divided by 5, 7, 9, and 11, gives remainders of 1, 2, 3, and 4, respectively.
i=0;j=0;m=0;t=0;a=(5,7, 9,11);r= (1, 2, 3, 4);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
3465 m + 1731, where m =0, 1, 2, 3, .........etc.
The smallest positive integer = 1,731
