sum_{0 le i

Question

(D) Let $S = \sum_{0 \le i < j \le n} i \binom{n}{j}$.We can rewrite the sum by changing the order of summation:$S = \sum_{j=1}^{n} \binom{n}{j} \sum_

Vedclass · Accepted Answer

$n(n - 1) 2^{n-3}$

Vedclass · Answer

(D) Let $S = \sum_{0 \le i We can rewrite the sum by changing the order of summation:$S = \sum_{j=1}^{n} \binom{n}{j} \sum_{i=0}^{j-1} i$.The inner sum is the sum of the first $(j-1)$ integers: $\sum_{i=0}^{j-1} i = \frac{(j-1)j}{2}$.Thus,$S = \sum_{j=1}^{n} \binom{n}{j} \frac{j(j-1)}{2} = \frac{1}{2} \sum_{j=2}^{n} \frac{n!}{j!(n-j)!} j(j-1)$.Using the identity $j(j-1) \binom{n}{j} = n(n-1) \binom{n-2}{j-2}$,we get:$S = \frac{1}{2} \sum_{j=2}^{n} n(n-1) \binom{n-2}{j-2} = \frac{n(n-1)}{2} \sum_{j=2}^{n} \binom{n-2}{j-2}$.Let $k = j-2$,then the sum becomes $\sum_{k=0}^{n-2} \binom{n-2}{k} = 2^{n-2}$.Therefore,$S = \frac{n(n-1)}{2} \cdot 2^{n-2} = n(n-1) 2^{n-3}$.

$\sum_{0 \le i < j \le n} i \binom{n}{j}$ is equal to

Similar Questions

The number of triangles that can be formed by choosing the vertices from a set of $12$ points,seven of which lie on the same straight line,is

If $2 \times {}^nC_5 = 9 \times {}^{n-2}C_5$,then the value of $n$ will be

From $6$ different novels and $3$ different dictionaries,$4$ novels and $1$ dictionary are to be selected and arranged in a row on a shelf so that the dictionary is always in the middle. The number of such arrangements is :

The set $S = \{1, 2, 3, \ldots, 12\}$ is to be partitioned into three sets $A, B, C$ of equal size. Thus $A \cup B \cup C = S$ and $A \cap B = B \cap C = C \cap A = \emptyset$. The number of ways to partition $S$ is

How many numbers can be formed from the digits $1, 2, 3, 4$ when the repetition is not allowed?

Vedclass Test Series

Exam Paper Generator

Online Exam Module