How many ordered triples of non-negative integer solutions are there to ?
(The tags have clues)
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.
If n = 0 , 1 0 n − 1 = 0 ⟹ 3 x = 3 y = 0
If n = 1 , trial and error gives ( x , y ) = ( 1 , 0 ) , ( 0 , 1 ) .
If n > 1 : 1 0 n is a multiple of 2 2 = 4 Hence right hand side is congruent to 3 m o d 4 . However perfect squares (check 0, 1, 2, 3) can only be congruent to 0 , 1 m o d 4 . Summing two perfect squares can only give 0 + 0 = 0 , 0 + 1 = 1 , ( 1 + 0 = 1 ) , 1 + 1 = 2 modulo 4 and this gives a contradiction.
Hence there are three solutions ( x , y , n ) = ( 0 , 0 , 0 ) , ( 0 , 1 , 1 ) , ( 1 , 0 , 1 ) .