Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 7.8.11 (If $p\mid d,\ p\equiv 3 \pmod 4$, then $x^2 - dy^2 = -1$ is not solvable)

Exercise 7.8.11 (If $p\mid d,\ p\equiv 3 \pmod 4$, then $x^2 - dy^2 = -1$ is not solvable)

Answers

Proof. We suppose that d is divisible by a prime number p , p 3 ( mod 4 ) . Assume for the sake of contradiction that there are integers x , y such that x 2 d y 2 = 1 . Then x 2 1 ( mod p ) , thus

( 1 p ) = 1 .

Therefore p = 2 or ( 1 ) ( p 1 ) 2 = 1 , so p 1 or 2 ( mod 4 ) , in contradiction with p 3 ( mod 4 ) , This contradiction shows that the equation x 2 d y 2 = 1 has no solution in integers. □

User profile picture
2025-08-28 07:54
Comments