Chinese Remainder Theorem, version 1.1, 2021-04-05.
Rolf Ptter

This is a program written in BASIC for the TI-83 Plus and the TI-84 Plus illustrating the Chinese remainder theorem.
Copy the file chinrem.8xp to your TI-83 plus or Ti-84 plus and start it via PRGM->EXEC->CHINREM.
You will be prompted for a list of moduli first, for example {7,8,9}, and then for a list of remainders, for example {2,3,4}. The program the solves the simultaneous congruences
x= 2 mod 7, x= 3 mod 8 and x= 4 mod 9.

The moduli needn't be pairwise coprime, but if m[i] and m[j] have gcd d>= 2 then r[i]-r[j] must be
divisible by d for the equations to be solvable.

After the result is shown, press any key to end the program. If you then press ENTER, the program will start anew. 