Let p be an odd prime and gcd( a, p) = gcd( b, p) = 1. Prove that either all three of
Chapter 9, Problem 10(choose chapter or problem)
Let p be an odd prime and gcd( a, p) = gcd( b, p) = 1. Prove that either all three of thequadratic congruencesx2 =a (mod p) x2 = b (mod p) x2 =ab (mod p)are solvable or exactly one of them admits a solution.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer