Suppose that gcd($a,p$) = gcd($b,p$) = 1, and neither of the congruences $x^2 ...
$x^2 \equiv a \mod p$, $\ x^2 \equiv b \mod p$, and $x^2 \equiv ab \mod p$, prove either all three are solvable or exactly one