My question is as following:
How do I solve:
$$3x+2y \equiv 2 \ \ (mod 5) $$
$$x+y \equiv 3 \ \ (mod 4)$$
My thought is to use Chinese remainder theorem to first find a solution such that:
$$z \equiv2 \ \ (mod5)$$
$$z \equiv 3 \ \ (mod 4)$$
Applying CRT, I got
$$z \equiv 7 \ \ (mod 20)$$
And for each possible value of $z$, we have a unique solution for $x$ and $y$, but I am wondering if it's the suitable way of solving these kind of problem.