Find integer $x$ such that -2310 ≤ $x$ ≤ 2310, and
$x$ ≡ 1 (mod 21),
$x$ ≡ 2 (mod 20),
$x$ ≡ 3 (mod 11)
-Currently covering a section on the Chinese remainder theorem and having trouble figuring this problem out or how to start it, any help/clarification is really appreciated.
First find $x$ such that $x \equiv 1 \mod 21$ and $2 \mod 20$, using the Euclidean algorithm on $1 + 21 a = x = 2 + 20 b$. You should get a solution of the form $x \equiv c \mod (20 \times 21)$. Then similarly find $x$ such that $x \equiv c \mod (20 \times 21)$ and $x \equiv 3 \mod 11$.