One of my professors gave out a practice exam for a Discrete Mathematics test, and I'm having a little trouble with this problem:
"Use the Chinese Remainder's Theorem to find ALL solutions to the system of congruence:
xmod 17 = 5
xmod12 = 3"
I've only ever seen Chinese Remainder Theorem questions set up as:
"x = amod(m1)
x = bmod(m2) "
So I'm a little confused on how to solve the question in the way he gave it. ie:
"xmod(m1) = a
xmod(m2) = b"
Thanks in advance!