Does $x^2 \equiv 211\pmod{ 159}$  have a solution? Note that 159=3*53. The answer to this question is yes. I managed to find two of the solutions. They are $x=23,136$ but there are two more. The main question that I have is whether there is an easier way to find all solutions of a quadratic congruence when the modulus is not prime. Is it always the case that there will be four solutions when the modulus is composite? By solutions I mean the least residues. Thank you! 
 A: If you know how to find the solutions when the modulus is prime, then, when the modulus is composite, solve the congruence modulo the primes, and use the Chinese Remainder Theorem to put them together to get solutions modulo the composites. 
The number of solutions is (give or take a few exceptional circumstances) $2^r$, where $r$ is the number of distinct primes dividing the modulus. In your case, there are 2 solutions modulo 3, and 2 solutions modulo 53, yielding 4 solutions modulo 159. 
A: Note that $159=3\cdot 53$. If the congruences $x^2\equiv 211\pmod{3}$ and $x^2\equiv 211\pmod{53}$ have solutions $x\equiv a \pmod{3}$ and $x\equiv b\pmod{53}$, then by the Chinese Remainder Theorem we can find an $x$ such that $x\equiv a \pmod{3}$ and $x\equiv b \pmod{53}$. Such an $x$ will have the property that $x^2\equiv 211\pmod{159}$.
To show that $x^2\equiv 1 \pmod{3}$ has a solution is trivial. 
So we look at $x^2\equiv 211\pmod{53}$. We can find an explicit solution. But it is easier to note that $211\equiv -1\pmod{53}$. And $x^2\equiv -1 \pmod{53}$ has a solution, since $53$ is a prime of the form $4k+1$.
