A Formula For The Sum Of The Triangular Numbers?


Answer :

Formula for T(n): T(n)=n(n+1)(n+2)6T(n)=\frac{n(n+1)(n+2)}{6} Proof: we can prove it in an inductive way.

Base case:T(1)=1236=1T(1)=\frac{1*2*3}{6}=1 Let n=k. We have T(n+1)=T(n)+t(n+1).T(n+1)=T(n)+t(n+1).

Therefore T(k+1)=T(k)+t(k+1)=k(k+1)(k+2)6+(k+1)(k+2)2=k(k+1)(k+2)+3(k+1)(k+2)6=(k+1)(k+2)(k+3)6T(k+1)=T(k)+t(k+1)=\frac{k(k+1)(k+2)}{6}+\frac{(k+1)(k+2)}{2}=\frac{k(k+1)(k+2)+3(k+1)(k+2)}{6}=\frac{(k+1)(k+2)(k+3)}{6}

Q.E.D


nthnth triangular number is the sum of nn consecutive natural numbers from starting which is simply n(n+1)/2n(n+1)/2. You want sum of first nn triangular numbers. Just take the sum Σi=1ni(i+1)2\Sigma_{i=1}^n \frac{i(i+1)}{2}.


Since the kk-th triangular number is T(k)=k(k+1)2T(k)=\frac{k(k+1)}{2}, so your sum is k=1nk(k+1)2=12(k=1nk2+k=1nk) \sum_{k=1}^n\frac{k(k+1)}{2}=\frac{1}{2}\biggl( \sum_{k=1}^n k^2+\sum_{k=1}^n k\biggr) The second summation is T(n)T(n), the first summation is 13n(n+12)(n+1) \frac{1}{3}n\left(n+\frac{1}{2}\right)(n+1) (a nice way to memorize it), you find it in several places (the book “Concrete Mathematics” by Graham, Knuth and Patashnik features several derivations of the formula).


Comments

Popular posts from this blog

Are Regular VACUUM ANALYZE Still Recommended Under 9.1?

Can Feynman Diagrams Be Used To Represent Any Perturbation Theory?