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 x 2 34 y 2 = 1 with y > 0 , y minimal, is ( ± 35 , 6 ) . By examining y = 1 , 2 , 3 , 4 , 5 , deduce that the equation x 2 34 y 2 = 1 has no integral solution. Observe that this latter equation has the rational solutions ( 5 3 , 1 3 ) , ( 3 5 , 1 5 ) . Using the first of these rational solutions, show that the congruence x 2 34 y 2 = 1 ( mod m ) has a solution provided that 3 m . Similarly, use the second rational solution to show that the congruence has a solution if 5 m . Use the Chinese Remainder Theorem to show that the congruence has a solution for all positive m .

Answers

Proof. We decompose 34 y 2 + 1 and 34 y 2 1 in prime numbers for y = 1 , 2 , 3 , 4 , 5 , 6 :

34 1 2 + 1 = 35 = 5 7 , 34 1 2 1 = 33 = 3 11 , 34 2 2 + 1 = 137 , 34 2 2 1 = 135 = 3 3 5 , 34 3 2 + 1 = 307 , 34 3 2 1 = 305 = 5 61 , 34 4 2 + 1 = 545 = 5 109 , 34 4 2 1 = 543 = 3 181 , 34 5 2 + 1 = 851 = 23 37 , 34 5 2 1 = 849 = 3 283 , 34 6 2 + 1 = 1225 = 5 2 7 2 .

The first square is 34 6 2 + 1 = 3 5 2 . Therefore the first positive solution of x 2 34 y 2 = ± 1 is ( 35 , 6 ) , which is a solution of x 2 34 y 2 = 1 .

By Problem 1, x 2 34 y 2 = 1 is not solvable, otherwise there would exist a positive solution of x 2 34 y 2 = 1 for some y [ [ 1 , 5 ] ] .

(Alternatively, we can use with more efficiency the Python method “pell_fermat” of Problem 9, which give the least positive solution of x 2 34 y 2 = ± 1 : we obtain ( 35 , 6 ) . This shows that x 2 34 y 2 = 1 is not solvable.)

Since

5 2 34 1 2 = 3 2 , 3 2 34 1 2 = 5 2 ,

The pairs ( 5 3 , 1 3 ) and ( 3 5 , 1 5 ) are rational solutions of x 2 34 y 2 = 1 .

Let m be a positive integer. Using the first of these rational solutions, 5 2 34 1 2 3 2 ( mod m ) . Suppose that 3 m . Then 3 has in inverse modulo m . If we write ā the class of an integer a in mℤ , we obtain

5 ¯ 2 34 ¯ 1 ¯ 2 = 3 ¯ 2 , ( 5 ¯ 3 ¯ 1 ) 2 34 ¯ ( 3 ¯ 1 ) 2 = 1 ¯ .

Put x 1 ¯ = 5 ¯ 3 ¯ 1 , y 0 ¯ = 3 ¯ 1 , where x 1 , y 1 are integers. Then

x 1 2 34 y 1 2 1 ( mod m ) .

The congruence x 2 34 y 2 1 ( mod m ) has a solution provided that 3 m .

Similarly, if 5 m , then 5 has an inverse modulo m . From 3 ¯ 2 34 ¯ 1 ¯ 2 = 5 ¯ 2 , we obtain that ( x 2 ¯ , y 2 ¯ ) = ( 3 ¯ 5 ¯ 1 , , 5 ¯ 1 ) gives a solution of x 2 34 y 2 1 ( mod m ) .

Now suppose that m is any integer, where m > 1 . Write m = 3 α 5 β u , where 3 u , 5 u . Put m 1 = 5 α and m 2 = 3 β u . Then m = m 1 m 2 , where m 1 m 2 = 1 .

Since 3 m 1 , there are some integers x 1 , y 1 such that x 1 2 34 y 1 2 1 ( mod m 1 ) , and since 5 m 2 , there are some integers x 2 , y 2 such that x 2 2 34 y 2 2 1 ( mod m 2 ) .

By the Chinese Remainder Theorem, since m 1 m 2 = 1 , there exist some integers x and y such that

{ x x 1 ( mod m 1 ) x x 2 ( mod m 2 )  and  { y y 1 ( mod m 1 ) y y 2 ( mod m 2 ) .

Then x 2 34 y 2 1 ( mod m 1 ) and x 2 34 y 2 1 ( mod m 2 ) , where m 1 m 2 = 1 . Hence x 2 34 y 2 1 ( mod m ) .

In conclusion, the equation x 2 34 y 2 = 1 has no solution in , but has solutions in and in mℤ for every m > 1 . □

User profile picture
2025-08-29 09:03
Comments