How do i solve square congruences with the Chinese Remainder Theorem

Question

I\'ve written a program that solves square congruences by doubling the modulus (b) and adding it to the first number (a) in x^2 ≡ a mod b, until a square is made. From looki