How many integers solutions does the next diophantine equation have?
x 2 − 1 5 y 2 = 2
Note: If you want to answer infinitum, just only choose 711
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
let's considerate x 2 − 1 5 y 2 ≡ x 2 ( m o d 5 ) , so if (x,y) is a pair such that it satisfaies the original diophantine equation, then x 2 ≡ 2 ( m o d 5 ) but if x ≡ 0 ( m o d 5 ) then x 2 ≡ 0 ( m o d 5 ) , if x ≡ 1 ( m o d 5 ) then x 2 ≡ 1 ( m o d 5 ) , if x ≡ 2 ( m o d 5 ) then x 2 ≡ 4 ( m o d 5 ) , if x ≡ 3 ( m o d 5 ) then x 2 ≡ 4 ( m o d 5 ) and if x ≡ 4 ( m o d 5 ) then x^2= 1 (mod 5), so the conclusion is there doesn't exist any solution for this equation. It's impossible x^2=2 (mod 5)
It's faster to check mod 3 . We get x 2 ≡ 2 ( m o d 3 ) is impossible.
Why must mod(5)???
Log in to reply
It's not necessary, mod(3) is also available or even more suitable. 1 5 ≡ 0 ( m o d 5 ) and 1 5 ≡ 0 ( m o d 3 )
Problem Loading...
Note Loading...
Set Loading...
x = 1 5 y 2 + 2 For there to be integer solutions for this equation, 1 5 y 2 + 2 must be a square number.
Also 1 5 y 2 + 2 can only end in a 2 or a 7 .
As there are no square numbers which can end in a 2 or a 7 , there cannot be any integer solutions.