Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 2.1.60 (Existence of solutions for $x^2 + 2 y^2 = p$.)

Exercise 2.1.60 (Existence of solutions for $x^2 + 2 y^2 = p$.)

Combine the results of the foregoing problems to show that a prime number p can be expressed in the form a 2 + 2 b 2 if and only if the congruence x 2 2 ( mod p ) is solvable. (In Chapter 3 we show that this congruence is solvable if and only if p = 2 or p 1  or  3 ( mod 8 ) .)

Answers

Proof. We want to prove, combining the results of the foregoing problems, that for any prime p ,

( a , b ) 2 , p = a 2 + 2 b 2 x , x 2 2 ( mod p ) .

If p = 2 , since 2 = 0 2 + 2 1 2 , and 0 2 2 ( mod 2 ) , the two members are true. Now, we may suppose that p is an odd prime.

(⇒)
Assume that p = a 2 + 2 b 2 for some integers a , b . If p a and p b , then p 2 a 2 + 2 b 2 = p , thus p 1 . Since p is a prime number, this is impossible, so p a or p b , i.e. p does not divide both a and b . By Exercice 59, x 2 2 ( mod p ) has a solution in .
(⇐)
Assume that there is some x such that x 2 2 ( mod p ) . By Exercise 56, at least one of the equations a 2 + 2 b 2 = p , a 2 + 2 b 2 = 2 p has a solution. By Exercise 58, if a 2 + 2 b 2 = 2 p has a solution, then a 2 + 2 b 2 = p has also a solution. In all cases a 2 + 2 b 2 has a solution.

The equivalence is proven. □

Note: If we know the complements of the law of quadratic reciprocity and the Legendre’s symbol , we obtain for an odd prime p

x , x 2 2 ( mod p ) ( 2 p ) = 1 ( 1 p ) ( 2 p ) = 1 ( 1 ) p 1 2 ( 1 ) p 2 1 8 = 1 .

If we list the values of ( 1 ) p 1 2 and ( 1 ) p 2 1 8 , we obtain

p  mod  8 ( 1 ) p 1 2 ( 1 ) p 2 1 8 ( 2 p ) 1 1 1 1 3 1 1 1 5 1 1 1 7 1 1 1

This shows that, for every odd prime p ,

( 2 p ) = 1 p 1 , 3 ( mod 8 ) .

To conclude, for every prime p ,

( a , b ) 2 , p = a 2 + 2 b 2 p = 2  or  p 1 , 3 ( mod 8 ) .

User profile picture
2024-08-07 09:45
Comments