# How do we get the result of the summation $\sum\limits_{k=1}^n k \cdot 2^k$? [duplicate]

Possible Duplicate:
Formula for calculating $\sum_{n=0}^{m}nr^n$

Can someone explain step by step how to derive the following identity? $$\sum_{k=1}^{n} k \cdot 2^k = 2(n \cdot 2^n - 2^n + 1)$$

-
What formulas related to this one do you know? – Davide Giraudo Mar 14 '12 at 15:39

1
– Tom Cooney Mar 14 '12 at 15:42
I recall the basic ones, that we are expected to know: sum of k = 1 to n of k is n(n+1) / 2 and geometric series formula ie. sum of n = 0 to m of a* r ^n – rrazd Mar 14 '12 at 15:42

2
Isn't this a multi duplicate? – Did Mar 14 '12 at 23:21

## marked as duplicate by lhf, Kannappan Sampath, Asaf Karagila, Hans Lundmark, t.b.Mar 15 '12 at 10:41

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

## 3 Answers

If you know $\sum_{k=1}^n a^k=\frac{a^{n+1}-1}{a-1}$, take the derivative of both sides with respect to $a$, multiply by $a$, and set $a=2$

-

Induction is a surefire way to prove it with elementary methods. With calculus and some formulas, we can approach this problem by evaluating a derivative in two different ways, as follows:

Quotient rule: $$\rm \frac{d}{dx}\frac{x^n-1}{x-1} =\frac{n\,x^{n-1}(x-1)-(x^n-1)(1)}{(x-1)^2} \tag{1}$$

Geometric formula:

$$\rm \frac{d}{dx}\frac{x^n-1}{x-1}=0+1x^0+2x^1+\cdots+n\,x^{n-1} \tag{2}$$

Equate equation $(1)$ with equation $(2)$, multiply both sides by $\rm x$ and then set $\rm x=2$.

-

Your last term in $(2)$ should be $nx^{n-1}$ instead – Kirthi Raman Mar 14 '12 at 16:07

Although you got great answers, I will add another way to look at the expression you are looking for

Let us denote

$$S = \sum_{k=1}^{n} k \cdot 2^k$$

This can be expanded as

$$\begin{align*} S &= 2 + 2 . 2^2 + 3 . 2^3 + \cdots n 2^n\\ 2S &= \hspace{8pt}+1.2^2+2.2^3 + \cdots (n-1) . 2^n+n . 2^{n+1} \end{align*}$$

If you notice, by multiplying by $2$ and writing under similar terms and then subtracting, we get

$$\begin{align*} S = n . 2^{n+1} - \left(2+2^2+2^3+\cdots+2^n \right) &= n .2^{n+1}-2^{n+1}+2\\ &= 2(n . 2^n-2^n+1) \end{align*}$$

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 13, "mathjax_display_tex": 6, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9225777983665466, "perplexity_flag": "middle"}