The number of seven-digit integers,with the s | vedclass

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

Question

(C) Let the seven digits be $x_1, x_2, \dots, x_7$ where $x_i \in \{1, 2, 3\}$.We need to find the number of solutions to $x_1 + x_2 + \dots + x_7 = 1

Vedclass · Accepted Answer

$77$

Vedclass · Answer

(C) Let the seven digits be $x_1, x_2, \dots, x_7$ where $x_i \in \{1, 2, 3\}$.We need to find the number of solutions to $x_1 + x_2 + \dots + x_7 = 10$.This is equivalent to finding the coefficient of $x^{10}$ in $(x + x^2 + x^3)^7$.$(x + x^2 + x^3)^7 = x^7(1 + x + x^2)^7 = x^7 \left(\frac{1 - x^3}{1 - x}ight)^7 = x^7(1 - x^3)^7(1 - x)^{-7}$.We need the coefficient of $x^{10}$ in $x^7(1 - x^3)^7(1 - x)^{-7}$,which is the coefficient of $x^3$ in $(1 - x^3)^7(1 - x)^{-7}$.$(1 - x^3)^7(1 - x)^{-7} = (1 - 7x^3 + \dots)(1 + 7x + \frac{7 	imes 8}{2}x^2 + \frac{7 	imes 8 	imes 9}{6}x^3 + \dots)$.The coefficient of $x^3$ is $1 	imes \binom{7+3-1}{3} - 7 	imes 1 = \binom{9}{3} - 7 = 84 - 7 = 77$.Alternatively,the possible sets of digits are:$1, 1, 1, 1, 1, 2, 3$ (sum $= 10$): Number of arrangements $= \frac{7!}{5!} = 42$.$1, 1, 1, 1, 2, 2, 2$ (sum $= 10$): Number of arrangements $= \frac{7!}{4!3!} = 35$.Total $= 42 + 35 = 77$.

The number of seven-digit integers,with the sum of the digits equal to $10$ and formed by using the digits $1, 2,$ and $3$ only,is

Similar Questions

The number of $3$-digit numbers,formed using the digits $2, 3, 4, 5$ and $7$,when the repetition of digits is not allowed,and which are not divisible by $3$,is equal to ..........

The total number of three-digit numbers,divisible by $3$,which can be formed using the digits $1, 3, 5, 8$,if repetition of digits is allowed,is:

$n$ objects are distributed at random among $n$ persons. The number of ways in which this can be done so that at least one of them will not get any object is

The number of four-lettered words that can be formed from the letters of the word $MAYANK$ such that both $A$'s are included but never together,is equal to:

If all the letters of the word $ACADEMICIAN$ are permuted in all possible ways,then the number of permutations in which no two $A$'s are together and all the consonants are together is:

Vedclass Test Series

Exam Paper Generator

Online Exam Module