Find the number of positive integer solutions for the equation:
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.
7 w 2 ≡ 0 , 3 m o d ( 4 ) so either x 2 , y 2 , z 2 ≡ 0 m o d ( 4 ) or x 2 , y 2 , z 2 ≡ 1 m o d ( 4 ) ( # ). Case1: x = 2 x 1 e t c : 4 x 1 2 + 4 y 1 2 + 4 z 1 2 = 7 w 2 Clearly w is even so we use a similar substitution ( w = 2 w 1 ) to obtain: x 1 2 + y 1 2 + z 1 2 = 7 w 1 2 Hence, (using proof by descent) there are no positive integer solutions. Case 2: All variables are odd (from # and parity) so we have ( 2 x 1 + 1 ) 2 + ( 2 y 1 + 1 ) 2 + ( 2 z 1 + 1 ) 2 = 7 ( 2 w 1 + 1 ) 2 This can be rearranged then divided by 4 to give: x 1 ( x 1 + 1 ) + y 1 ( y 1 + 1 ) + z 1 ( z 1 + 1 ) − 1 = 7 w 1 ( w 1 + 1 ) ⟹ o d d = e v e n This contradiction together with case 1 proves that there are no positive integer solutions.