Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 3.5.10 (Prime numbers represented by $x^2 + 5y^2$)
Exercise 3.5.10 (Prime numbers represented by $x^2 + 5y^2$)
Use the preceding problem to show that if is represented by the form , then or , and that if is a prime represented by the form then . By combining this information with the result of Problem 4, conclude that an odd prime is represented by the form if and only if or or , and that is represented by the form if and only if or or .
Answers
Proof.
- (a)
-
Suppose that the prime
is represented by the form
. By Problem 9,
is a square modulo
, so
for some integer
(this is obvious here: if
for some integers
, then
, where
).
Then , thus , so for some integer , and , therefore
where is prime. This implies that
Suppose now that is represented by . By the same Problem 9, is a square modulo , so . Therefore is even, so for some integer , hence
Note that is not represented by the form , otherwise for some integers . Then , thus , so . If , then , but is not a perfect square, and if , then , and this is also impossible. This shows that , so .
Moreover , thus
Then , thus
To conclude,
- (b)
-
By Problem 5, a prime is represented by or by if and only if , or . By part (a), cannot be represented simultaneously by the two forms .
- If , then is represented by , but not by by Problem 5.
- If , then is represented by , but not by (see above).
- If , then thus . This shows that is not represented by , hence by Problem 5, is represented by .
- If , then , thus . This shows that is not represented by , hence is represented by .
In conclusion, a prime is represented by the form if and only if or , and is represented by the form if and only if or .
Note: the second case is equivalent to the condition “ or is represented by the form ”.