Homepage › Solution manuals › Kenneth Ireland › A Classical Introduction to Modern Number Theory › Exercise 5.21
Exercise 5.21
Apply the method of Ex. 5.19 and 5.20 to find those primes for which is a quadratic residue.
Answers
Proof. Let ( is positive, odd and square-free). We first search the integers , such that .
The first case is equivalent to , that is .
The second case gives , that is , or equivalently .
So is the set of the integers such that , .
As , is not a quadratic residue modulo or .
.
From Ex.5.20, we know that is a quadratic residue modulo an odd prime , , , iff for some .
.
As , , so the same reasoning as in Ex. 5.20 show that is a quadratic residue modulo iff .
Conclusion : is a quadratic residue for , and for the primes such that
□