Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 7.8.12 ( If $p\equiv 1 \pmod 4$, then $x^2 - p y^2 = -1$ is solvable)
Exercise 7.8.12 ( If $p\equiv 1 \pmod 4$, then $x^2 - p y^2 = -1$ is solvable)
Suppose that . Show that if , then is odd and is even. Suppose that with , minimal. Show that g.c.d. . Deduce that one of two cases arises: Case 1. . Case 2. . Show that in Case 1, with , a contradiction to the minimality of . Show that in Case 2, . Conclude that if then the equation has an integral solution.
Answers
Proof. Suppose that , where . Then , so and have distinct parity.
If is even and is odd, then and , so , which is false. Therefore is odd and is even.
By Theorem 7.25, since is not a perfect square, has positive solutions. We define as a positive solution with minimal.
Let . Then , and , thus . Therefore or . moreover is odd, thus and , so . Hence :
Since , , thus or .
-
Case 1. If , then
where , , are integers. Moreover, by (1), , a fortiori
By (2) and (3), Lemma 5.4 p. 232 shows that there are integers , such that
so
-
Case 2. If , then
We obtain similarly
Consider the case 1. By (4), . Moreover , thus , in contradiction with the minimality of . Therefore case 1 never occurs, and case 2 is true. By (6),
This shows that is solvable.
In conclusion, if , then the equation has an integral solution. □