Solve by finding a combinatorial argument

n C 0 + n C 1 + n C 2 + n C 3 + . . . + n C n 1 + n C n = ? ^n C_0 + ^n C_1 + ^n C_2 + ^n C_3 + ... + ^n C_{n-1} + ^n C_n =?

1 1 2 n 1 2^{n-1} 2 n 2^n 2 n + 1 2^{n+1}

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Kay Xspre
Nov 1, 2015

Notice that it is the binomial coefficient of the expansion of ( x + y ) n (x+y)^n . Just substitute x = y = 1 x=y=1 , then all the coefficient will have the sum of 2 n 2^n

Harshal Gajjar
Oct 31, 2015

Hint: Expression in the question represents all possible ways of selecting student(s) from a class having n n students.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...