Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 7.8.13 ($x^2 - 34 y^2 = -1$ is not solvable, but has solutions modulo $m$ for every $m$)
Exercise 7.8.13 ($x^2 - 34 y^2 = -1$ is not solvable, but has solutions modulo $m$ for every $m$)
Show that the solution of with , minimal, is . By examining deduce that the equation has no integral solution. Observe that this latter equation has the rational solutions . Using the first of these rational solutions, show that the congruence has a solution provided that . Similarly, use the second rational solution to show that the congruence has a solution if . Use the Chinese Remainder Theorem to show that the congruence has a solution for all positive .
Answers
Proof. We decompose and in prime numbers for :
The first square is . Therefore the first positive solution of is , which is a solution of .
By Problem 1, is not solvable, otherwise there would exist a positive solution of for some .
(Alternatively, we can use with more efficiency the Python method “pell_fermat” of Problem 9, which give the least positive solution of : we obtain . This shows that is not solvable.)
Since
The pairs and are rational solutions of .
Let be a positive integer. Using the first of these rational solutions, . Suppose that . Then has in inverse modulo . If we write the class of an integer in , we obtain
Put , where are integers. Then
The congruence has a solution provided that .
Similarly, if , then has an inverse modulo . From , we obtain that gives a solution of
Now suppose that is any integer, where . Write , where . Put and . Then , where .
Since , there are some integers such that , and since , there are some integers such that .
By the Chinese Remainder Theorem, since , there exist some integers and such that
Then and , where . Hence .
In conclusion, the equation has no solution in , but has solutions in and in for every . □