Show that if p=4k + 3 is prime and a2 + b2 ≡ 0 (mod p), then a≡ b≡ 0 (mod p).[Hint: If a≢ 0 (mod p), then there exists an integer c such that ac = 1 (mod p); use this fact to contradict Theorem 5.5.]
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.