Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I got a question in my homework, which is:

Find the following sum and prove your claim: $$1\cdot2 + 2\cdot3 + 3\cdot4 + \cdots + n\cdot(n+1).$$

I want to prove this by mathematical induction, but I couldn't find an expression of the sum. If anyone has any idea, please share with me. Thank you.

share|improve this question
    
A cleaned up the question a little bit. I also don't think that this has much to do with Gauss sums, but I'm open to being proven wrong about this :) –  Dylan Moreland Feb 5 '12 at 18:37
    
What about $\sum_{k=1}^n k^2+k$? –  ulead86 Feb 5 '12 at 18:38

5 Answers 5

up vote 8 down vote accepted

$\bf Hint:$ $\sum_{i=1}^n i(i+1)=\sum_{i=1}^n i^2+\sum_{i=1}^n i$.

share|improve this answer
1  
How do we evaluate $\sum_{i=1}^n i^2$? Doing this decomposition actually takes us a step backwards. –  Eric Naslund Feb 5 '12 at 19:42
2  
@Eric: It may be forwards in the event that Allan already knows the formula for $\sum i^2$. –  Jonas Meyer Feb 5 '12 at 19:43

Hint: Note that the general term in your series is $2\binom{n+1}{2}$.

From the definition of Pascal's Triangle, we get $$ \binom{n+2}{3}=\binom{n+1}{2}+\binom{n+1}{3} $$ which leads to the formula, ripe for telescoping series: $$ \binom{n+1}{2}=\binom{n+2}{3}-\binom{n+1}{3} $$

share|improve this answer
2  
And, in general, we have that $$\sum_{k=1}^N \binom{n}{k} =\binom{n+1}{k+1}.$$ The so called "Hockey Stick" binomial formula. –  Eric Naslund Feb 5 '12 at 19:14
2  
@Eric: and that is a special case of $$\sum_k\binom{n-k}{i}\binom{k}{j}=\binom{n+1}{i+j+1}$$ (where $j=0$). I don't know if that has a name. –  robjohn Feb 5 '12 at 19:24

I see two approaches:

  1. You can decompose it into (1²+2²+...+n²) + (1+2+...+n). For both of them formulas expressing the sum directly are easily available.
  2. Since your terms are quadratic, the sum can be expressed by a polynomial of third degree.
    So you can use the ansatz a*x³ + b*x² + c*x + d and determine a, b, c, d so it fits 4 manually calculated elements.

You should be able to figure out the details from that. Both approaches work on other, similar problems too. So you should have them in your toolbox for later problems/the exam.

share|improve this answer
    
"You can use the ansatz"? Is this actually used in English? I'd be happy to hear that :) –  Niklas B. Feb 5 '12 at 18:58
    
@NiklasB. I hear it all the time in physics, even when talking in English. en.wikipedia.org/wiki/Ansatz –  CodesInChaos Feb 5 '12 at 19:06
    
Nice :) Thanks! –  Niklas B. Feb 5 '12 at 19:08
    
@Niklas: "Ansatz" is now a perfectly serviceable (technical) English word. ;) –  J. M. Feb 6 '12 at 16:26

Another hint: $$k(k+1)=\frac{1}{3}(k(k+1)(k+2)-(k-1)k(k+1)).$$ The right-hand side gives you a telescoping sum.

share|improve this answer
    
See robjohn's closely related answer using binomial coefficients. –  Jonas Meyer Feb 5 '12 at 19:19

If you don't know where to start, I suggest you rewrite the sum using the Σ(i:1-> n) notation. It eventually leads to a simpler expression.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.