Exercise 5.21

Apply the method of Ex. 5.19 and 5.20 to find those primes for which 21 is a quadratic residue.

Answers

Proof. Let D = 21 = 3 × 7 ( D is positive, odd and square-free). We first search the ϕ ( D ) ∕ 2 = 6 integers a , 1 ≤ a ≤ 21 , such that ( a ∕ D ) = 1 .

( a 21 ) = 1 ⟺ ( a 3 ) = ( a 7 ) = 1 or ( a 3 ) = ( a 7 ) = − 1 .

The first case is equivalent to a ≡ 1 ( mod 3 ) , a ≡ 1 , 2 , 4 ( mod 7 ) , that is a ≡ 1 , 16 , 4 ( mod 21 ) .

The second case gives a ≡ − 1 ( mod 3 ) , a ≡ − 1 , − 2 , − 4 ( mod 7 ) , that is a ≡ − 1 , − 16 , − 4 ( mod 21 ) , or equivalently a ≡ 20 , 5 , 17 ( mod 21 ) .

So A = { 1 , 4 , 5 , 16 , 17 , 20 } is the set of the integers a such that 1 ≤ a ≤ 21 , ( a ∕ D ) = 1 .

As ( 21 ∕ 3 ) = ( 21 ∕ 7 ) = 0 , 21 is not a quadratic residue modulo 3 or 7 .

∙ p ≡ 1 ( mod 4 ) .

From Ex.5.20, we know that D = 21 is a quadratic residue modulo an odd prime p , p ≠ 3 , p ≠ 7 , p ≡ 1 ( mod 4 ) , iff p ≡ a ( mod D ) for some a ∈ A .

∙ p ≡ − 1 ( mod 4 ) .

As D = 21 ≡ 1 ( mod 4 ) , ( D p ) ( p D ) = ( − 1 ) p − 1 2 D − 1 2 = 1 , so the same reasoning as in Ex. 5.20 show that D is a quadratic residue modulo 21 iff p ≡ a , a ∈ A .

Conclusion : 21 is a quadratic residue for 2 , and for the primes p such that

p ≡ 1 , 4 , 5 , 16 , 17 , 20 ( mod 21 ) .

□

User profile picture
2022-07-19 00:00
Comments