The number of ways of selecting 8 letters fro | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(C) The number of selections is the coefficient of $x^8$ in the expansion of $(1 + x + x^2 + \dots + x^8)(1 + x + x^2 + \dots + x^8)(1 + x)^8$.This is

Vedclass · Accepted Answer

$10 \cdot 2^7$

Vedclass · Answer

(C) The number of selections is the coefficient of $x^8$ in the expansion of $(1 + x + x^2 + \dots + x^8)(1 + x + x^2 + \dots + x^8)(1 + x)^8$.This is the coefficient of $x^8$ in $\left(\frac{1 - x^9}{1 - x}\right)^2 (1 + x)^8$.Since we are looking for the coefficient of $x^8$,we can ignore the $(1 - x^9)^2$ term as it contributes only $1$ to the coefficient of $x^8$.Thus,we need the coefficient of $x^8$ in $(1 - x)^{-2} (1 + x)^8$.$(1 - x)^{-2} = 1 + 2x + 3x^2 + \dots + 9x^8 + \dots$$(1 + x)^8 = \sum_{r=0}^{8} {}^8C_r x^r = {}^8C_0 + {}^8C_1 x + {}^8C_2 x^2 + \dots + {}^8C_8 x^8$.The coefficient of $x^8$ is $\sum_{r=0}^{8} (r+1) {}^8C_r = {}^8C_0 + 2{}^8C_1 + 3{}^8C_2 + \dots + 9{}^8C_8$.Consider $f(x) = \sum_{r=0}^{8} {}^8C_r x^{r+1} = x(1 + x)^8$.Differentiating with respect to $x$: $f'(x) = \sum_{r=0}^{8} (r+1) {}^8C_r x^r = (1 + x)^8 + 8x(1 + x)^7$.Setting $x = 1$,we get $\sum_{r=0}^{8} (r+1) {}^8C_r = (1 + 1)^8 + 8(1)(1 + 1)^7 = 2^8 + 8 \cdot 2^7 = 2^7(2 + 8) = 10 \cdot 2^7$.

$LIST-I$	$LIST-II$
$P$. The value of $\alpha_1$ is	$1. 136$
$Q$. The value of $\alpha_2$ is	$2. 189$
$R$. The value of $\alpha_3$ is	$3. 192$
$S$. The value of $\alpha_4$ is	$4. 200$
	$5. 381$
	$6. 461$

The number of ways of selecting $8$ letters from $24$ letters,of which $8$ are $a$,$8$ are $b$,and the remaining $8$ are distinct,is given by:

Similar Questions

The value of $\sum\limits_{r = 0}^{15} {\left( {{}^{15}{C_r} \cdot {}^{40}{C_{15}} \cdot {}^{20}{C_r} - {}^{35}{C_{15}} \cdot {}^{15}{C_r} \cdot {}^{25}{C_r}} \right)}$ is:

The number of $6$-letter words,with or without meaning,that can be formed using the letters of the word $\text{MATHS}$ such that any letter that appears in the word must appear at least twice,is $...$

Let $n = 1! + 4! + 7! + \ldots + 400!$. Then the ten's digit of $n$ is

$A$ string of letters is to be formed by using $4$ letters from all the letters of the word "$MATHEMATICS$". The number of ways this can be done such that two letters are of the same kind and the other two are of a different kind is:

Vedclass Test Series

Exam Paper Generator

Online Exam Module