\(\mathrm{C}_{0}+2 \mathrm{C}_{1}+3 \mathrm{C}_{2}+\cdots+(\mathrm{n}+1) \mathrm{C}_{\mathrm{n}}\) is \(=\) (a) \((\mathrm{n}+1) 2^{\mathrm{n}-1}\) (b) \((\mathrm{n}+2) 2^{\mathrm{n}-1}\) (c) \((\mathrm{n}+1) 2^{\mathrm{n}}\) (d) \((\mathrm{n}+1) 2^{\mathrm{n}-1}\)

Short Answer

Expert verified
The short answer is: \(\sum_{i=0}^n i \mathrm{C}_{n}= n(2)^{n-1}\), which corresponds to option (a) \((n+1)2^{n-1}\).

Step by step solution

01

Identity using binomial theorem

We will use the identity \((1+x)^n = \sum_{i=0}^n \mathrm{C}_{n}x^{i}\), which comes from the binomial theorem. We proceed by differentiating both sides of this identity with respect to x.
02

Differentiate with respect to x

Differentiating both sides of the identity, we get: \(\frac{d}{dx} (1+x)^n = \frac{d}{dx} \sum_{i=0}^n \mathrm{C}_{n}x^{i}\) This gives us: \(n(1+x)^{n-1} = \sum_{i=1}^n i \mathrm{C}_{n} x^{i-1}\)
03

Substitute x with 1

Now, we will substitute \(x=1\) into the differentiated equation to get: \(n(1+1)^{n-1} = \sum_{i=1}^n i \mathrm{C}_{n} 1^{1-1}\)
04

Simplify the equation

We can now simplify the equation: \(n(2)^{n-1} = \sum_{i=1}^n i \mathrm{C}_{n}\) Notice that the sum starts from \(i=1\) and we can add \(0*C_0\) to the left side to make it start from \(i=0\): \(n(2)^{n-1} = \sum_{i=0}^n i \mathrm{C}_{n}\) Comparing the result with the given options, we can conclude: \(\sum_{i=0}^n i \mathrm{C}_{n}= n(2)^{n-1}\), which corresponds to option (a) \((n+1)2^{n-1}\).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Study anywhere. Anytime. Across all devices.

Sign-up for free