Answer :
Formula for T(n): T(n)=6n(n+1)(n+2) Proof: we can prove it in an inductive way.
Base case:T(1)=61∗2∗3=1 Let n=k. We have T(n+1)=T(n)+t(n+1).
Therefore T(k+1)=T(k)+t(k+1)=6k(k+1)(k+2)+2(k+1)(k+2)=6k(k+1)(k+2)+3(k+1)(k+2)=6(k+1)(k+2)(k+3)
Q.E.D
nth triangular number is the sum of n consecutive natural numbers from starting which is simply n(n+1)/2. You want sum of first n triangular numbers. Just take the sum Σi=1n2i(i+1).
Since the k-th triangular number is T(k)=2k(k+1), so your sum is k=1∑n2k(k+1)=21(k=1∑nk2+k=1∑nk) The second summation is T(n), the first summation is 31n(n+21)(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
Post a Comment