NOTE: This page randomly generates an exercise and its solution. Click here to refresh the page and generate a new exercise. Use the [link] below if you want to return to the same exercise again at a later time. Click here to go back to the main page with the course information and schedule.
Exercise: Solve the following system of equations:
x
1 (mod 4)
x
0 (mod 3)
Using the explicit formula for a Chinese remainder theorem solution for a system of two equations when the moduli are coprime, we find that the unique congruence class of solutions is:
x
1 ⋅ (3 ⋅ 3-1) + 0 ⋅ (4 ⋅ 4-1) (mod (4 ⋅ 3))
9 (mod 12)