What is the sum of all triangular numbers which can be expressed as the sum of two consecutive odd squares?
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.
Write 2 n ( n + 1 ) = ( 2 k − 1 ) 2 + ( 2 k + 1 ) 2 . WLOG k ≥ 0 . After multiplying by 8 and adding 1 to both sides, we get ( 2 n + 1 ) 2 = ( 8 k ) 2 + 1 7 So ( 2 n + 1 + 8 k ) ( 2 n + 1 − 8 k ) = 1 7 , and the only way to write it this way is if the first factor is 1 7 and the second one is 1 . So there is exactly one positive value of n that works, namely n = 4 . So the answer is 1 0 .