prove that if p is an odd prime then x 2 2 mod p has solutions if and only if p 1 or 7 mod 8 297

Question

James Chok · Answer

Okay, so for this question, we want to show that x squared is equivalent to a mod P. If there ha

Shaiju T · Answer

In this question, we are given that if p is an odd prime number, then we have to prove that 2 mu

Sri K · Answer

So here in the first part of the question, we can say that let G be a fixed primitive root. If G

Madhur L · Answer

Hello students, here given T be an odd prime and also given G is primitive root modulo p. We hav

Sri K · Answer

So here in the first part of the question, we can say that let G be a fixed primitive root. If G

Prove that if p is an odd prime, then x 2 ≡ 2 (mod p) has solutions if and only if p ≡ 1 or 7 (mod 8).