Binomial Theorem
Grade 11

Question:

<p>If (1 + x)<sup>n</sup>&nbsp;= C<sub>0</sub>&nbsp;+ C<sub>1</sub>x + C<sub>2</sub>x<sup>2</sup>&nbsp;+ ... + C<sub>n</sub>x<sup>n</sup>, then the value of C<sub>0</sub>&nbsp;+ 2C<sub>1</sub>&nbsp;+ 3C<sub>2</sub>&nbsp;+ ... + (n + 1)C<sub>n</sub> is</p>
<p style="display:inline">(n + 2) 2<sup>n</sup></p>
<p style="display:inline">(n + 1) 2<sup>n-1</sup></p>
<p style="display:inline">(n + 2) 2<sup>n-1</sup></p>
<p style="display:inline">(n + 1) 2<sup>n</sup></p>

Step-by-Step Solution

Key Concept: Split the sum ∑(r+1)Cᵣ into ∑rCᵣ + ∑Cᵣ, then use the identity rCᵣ = n·C_{r-1} to convert the first sum and apply binomial expansions: ∑rCᵣ = n·2^(n-1) and ∑Cᵣ = 2^n.
<p>We have,<br /> C<sub>0</sub>&nbsp;+ 2C<sub>1</sub>&nbsp;+ 3C<sub>2</sub>&nbsp;+ ... + (n + 1) C<sub>n</sub><br /> =&nbsp;<span class="math-tex">$\sum_\limits{r=0}^{n}$</span>&nbsp;(r + 1)C<sub>r</sub><br /> =&nbsp;<span class="math-tex">$\sum_\limits{r=0}^{n}$</span>&nbsp;(r + 1)&nbsp;<sup>n</sup>C<sub>r</sub><br /> =&nbsp;<span class="math-tex">$\sum_\limits{r=0}^{n}$</span>&nbsp;(r<span class="math-tex">$\cdot$</span><sup>n</sup>C<sub>r</sub>&nbsp;+&nbsp;<sup>n</sup>C<sub>r</sub>)<br /> =&nbsp;<span class="math-tex">$\sum_\limits{r=0}^{n}$</span>&nbsp;r<span class="math-tex">$\cdot$</span><sup>n</sup>C<sub>r</sub>&nbsp;+&nbsp;<span class="math-tex">$\sum_\limits{r=0}^{n}$</span>&nbsp;<sup>n</sup>C<sub>r</sub><br /> <span class="math-tex">$=\sum_\limits{r=1}^{n} r \cdot \frac{n}{r}$</span>&nbsp;<sup>n-1</sup>C<sub>r-1</sub>&nbsp;+&nbsp;<span class="math-tex">$\sum_\limits{r=0}^{n}$</span>&nbsp;<sup>n</sup>C<sub>r</sub>&nbsp;... [<span class="math-tex">$\because$</span>&nbsp;<sup>n</sup>C<sub>r</sub>&nbsp;=&nbsp;<span class="math-tex">$\frac{n}{r}\cdot$</span>&nbsp;<sup>n-1</sup>C<sub>r-1</sub>]<br /> = n(<span class="math-tex">$\sum_\limits{r=1}^{n}$</span>&nbsp;<sup>n-1</sup>C<sub>r-1</sub>) + (<span class="math-tex">$\sum_\limits{r=0}^{n}$</span>&nbsp;<sup>n</sup>C<sub>r</sub>)<br /> = n(<sup>n-1</sup>C<sub>0</sub>&nbsp;+&nbsp;<sup>n-1</sup>C<sub>1</sub>&nbsp;+ ... +&nbsp;<sup>n-1</sup>C<sub>n-1</sub>) + (<sup>n</sup>C<sub>0</sub>&nbsp;+&nbsp;<sup>n</sup>C<sub>1</sub>&nbsp;+ ... +&nbsp;<sup>n</sup>C<sub>n</sub>)<br /> = n<span class="math-tex">$\cdot$</span>2<sup>n-1</sup>&nbsp;+ 2<sup>n</sup><br /> = n<span class="math-tex">$\cdot$</span>2<sup>n-1</sup>&nbsp;+ 2<span class="math-tex">$\cdot$</span>(2<sup>n-1</sup>)<br /> = (n + 2)<span class="math-tex">$\cdot$</span>2<sup>n-1</sup></p>
Correct Answer: C

Master Binomial Theorem with Mathbee

Practice this topic under real exam conditions with strict timers, or ask our AI Mentor to explain the concepts step-by-step.

Start Practicing for Free