How many ordered-pairs of integers ( x , y ) satisfy the equation 2 0 1 7 x 2 + y 2 = 2 0 1 9 2 0 1 9
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.
But in this question y^{2} has co efficient 1 which is only possible if n = 0 in your generalized case , whereas 0 isn't a positive integer
Notice that 2 0 1 9 ≡ 3 ( m o d 4 ) . Then 2 0 1 9 2 0 1 9 ≡ 2 0 1 9 3 ( m o d 2 0 1 7 ) Having said that, y 2 ≡ 8 ( m o d 2 0 1 7 ) but that would mean that y ≡ 8 ( m o d 2 0 1 7 ) implying that there are not integer solutions to this equation.
you cant just take square roots of non perfect squares like this in modular arithematic,as you can see that 8(mod 2017) is equivalent to 2025(mod 2017) which in fact is 45x45
Problem Loading...
Note Loading...
Set Loading...
Notice that 2 0 1 7 ≡ 1 ( m o d 4 ) and 2 0 1 9 2 0 1 9 ≡ ( − 1 ) 2 0 1 9 ≡ − 1 ≡ 3 ( m o d 4 ) .
Hence our equation changes to x 2 + y 2 ≡ 3 ( m o d 4 ) . But squares leave a remainder 0 or 1 when divided by 4. Thus x 2 + y 2 ≡ 0 , 1 , 2 ( m o d 4 ) and x 2 + y 2 ≡ 3 ( m o d 4 ) . So we conclude that the equation 2 0 1 7 x 2 + y 2 = 2 0 1 9 2 0 1 9 does not have integral solutions.