Exercise 3.2.4 (Numerical examples)

Which of the following congruences are solvable?

( a ) x 2 ≡ 5 ( mod 227 ) ( b ) x 2 ≡ 5 ( mod 229 ) ( c ) x 2 ≡ − 5 ( mod 227 ) ( d ) x 2 ≡ − 5 ( mod 229 ) ( e ) x 2 ≡ 7 ( mod 1009 ) ( f ) x 2 ≡ − 7 ( mod 1009 )

(Note that 227 , 229 and 1009 are primes.)

Answers

Proof.

(a)
Using the law of quadratic reciprocity, since 5 ≡ 1 ( mod 4 ) , ( 5 227 ) = ( 227 5 ) = ( 2 5 ) = − 1 .

The congruence x 2 ≡ 5 ( mod 227 ) is not solvable.

(b)
Similarly, ( 5 229 ) = ( 229 5 ) = ( 4 5 ) = 1 .

The congruence x 2 ≡ 5 ( mod 229 ) is solvable.

(c)
Now ( − 5 227 ) = ( − 1 227 ) ( 5 227 ) = ( − 1 ) ( − 1 ) = 1 .

The congruence x 2 ≡ − 5 ( mod 227 ) is solvable.

(d)
Similarly, ( − 5 229 ) = ( − 1 229 ) ( 5 229 ) = 1 ⋅ 1 = 1 .

The congruence x 2 ≡ − 5 ( mod 229 ) is solvable.

(e)
Here, since 1009 ≡ 1 ( mod 4 ) , ( 7 1009 ) = ( 1009 7 ) = ( 144 ⋅ 7 + 1 7 ) = ( 1 7 ) = 1 .

The congruence x 2 ≡ 7 ( mod 1009 ) is solvable.

(f)
( − 7 1009 ) = ( − 1 1009 ) ( 7 1009 ) = 1 ⋅ 1 = 1 .

The congruence x 2 ≡ − 7 ( mod 1009 ) is solvable.

□
User profile picture
2024-10-22 09:34
Comments