c 1 + 3 = 4 1 5 + 2 1 = 3 6 2 1 0 + 2 3 1 = 4 4 1 Gautam desires to form square numbers under addition operation. To do this he added up the two consecutive triangular numbers and found some of the square numbers(above).
Is it true that the sum of two consecutive triangular numbers is always an square number ?
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 you draw n 2 dots(an n × n square),and rotate it 45 degrees.Count it again (row by row,from left to right,up to down),there will be 1 + 2 + 3 + . . . + ( n − 1 ) + n + ( n − 1 ) + . . . + 3 + 2 + 1 dots.We get n 2 = [ 1 + 2 + . . . + ( n − 1 ) + n ] + [ 1 + 2 + . . . + ( n − 2 ) + ( n − 1 ) ] .Hence,a square is the sum of two consecutive triangular numbers.
Let T k − 1 and T k be two consecutive triangular numbers. Now under addition operations we have T k − 1 + T k = 2 ( k − 1 ) ( k − 1 + 1 ) + 2 k ( k + 1 ) = 2 k ( k − 1 + k + 1 ) = k 2 Therefore, the sum of two consecutive triangular number is always a square number.
The much effective solution would be pictorial representation of sum of such two numbers
Problem Loading...
Note Loading...
Set Loading...
Any triangular number can be represented of the form 2 n ( n + 1 ) (since they are of the form 1 + 2 + 3 + … + n ). Then, the succeeding triangular number will be equal to 2 ( n + 1 ) ( n + 2 ) .
Their sum will be 2 n ( n + 1 ) + ( n + 1 ) ( n + 2 ) ⇒ 2 2 ( n + 1 ) ( n + 1 ) ⇒ ( n + 1 ) 2
Therefore, the sum of any two consecutive triangular numbers is a perfect square.