Triangular numbers are defined as Tn:=1+2+...+n for n>= 1. Find a simple formula for Tn+Tn-1 and prove it.
I know Tn=n(n+1)/2 so would Tn-1=n(n-1)/2?
And then would I prove it by just adding Tn+Tn-1?
Triangular numbers are defined as Tn:=1+2+...+n for n>= 1. Find a simple formula for Tn+Tn-1 and prove it.
I know Tn=n(n+1)/2 so would Tn-1=n(n-1)/2?
And then would I prove it by just adding Tn+Tn-1?
I'll assume that by "Tn-1" you mean "$T_{n-1}$" and not "$T_n-1$". (You could have produced this using $T_{n-1}$.)
I suspect that the idea isn't to use that formula and manipulate it algebraically, but to write the two sums like this:
1 + 2 + 3 +...+(n-1)+ n
(n-1)+(n-2)+(n-3)+...+ 1 + 0
and to conclude that they add up to $n^2$.