Find the sum of all the integers for which is a perfect square.
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.
We want n 2 + n + 4 1 = m 2 for some integer m ≥ 0 . Multiplying by 4, completing the square, and rearranging the terms we find 1 6 3 = 4 m 2 − ( 2 n + 1 ) 2 = ( 2 m − 2 n − 1 ) ( 2 m + 2 n + 1 ) . Since 163 is prime, one factor must be ± 1 6 3 and the other ± 1 . The sum of the factors is 4 m = 1 6 4 so m = 4 1 . Substituting into the original equation, we find n = 4 0 and n = − 4 1 , with their sum being − 1 .