Let S = {1, 2, 3, 4, 5, 6, 7, 8, 9}. Let x be | vedclass

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

Question

(C) The set $S$ contains $9$ distinct digits. For $x$: We choose $1$ digit to be repeated twice, which can be done in ${}^{9}C_{1}$ ways. The remainin

Vedclass · Accepted Answer

$21x = 4y$

Vedclass · Answer

(C) The set $S$ contains $9$ distinct digits. For $x$: We choose $1$ digit to be repeated twice, which can be done in ${}^{9}C_{1}$ ways. The remaining $7$ digits are chosen from the remaining $8$ digits in ${}^{8}C_{7}$ ways. The total number of arrangements is $\frac{9!}{2!}$. Thus, $x = {}^{9}C_{1} 	imes {}^{8}C_{7} 	imes \frac{9!}{2!} = 9 	imes 8 	imes \frac{9!}{2} = 36 	imes 9!$. For $y$: We choose $2$ digits to be repeated twice, which can be done in ${}^{9}C_{2}$ ways. The remaining $5$ digits are chosen from the remaining $7$ digits in ${}^{7}C_{5}$ ways. The total number of arrangements is $\frac{9!}{2! 	imes 2!}$. Thus, $y = {}^{9}C_{2} 	imes {}^{7}C_{5} 	imes \frac{9!}{2! 	imes 2!} = \frac{9 	imes 8}{2} 	imes \frac{7 	imes 6}{2} 	imes \frac{9!}{4} = 36 	imes 21 	imes \frac{9!}{4} = 189 	imes 9!$. Calculating the ratio: $\frac{x}{y} = \frac{36 	imes 9!}{189 	imes 9!} = \frac{36}{189} = \frac{4}{21}$. Therefore, $21x = 4y$.

Similar Questions

An eight-digit number divisible by $9$ is to be formed using digits from $0$ to $9$ without repeating the digits. The number of ways in which this can be done is: (in $(7!)$)

In a circus,there are $10$ cages for accommodating $10$ animals. Out of these,$4$ cages are so small that $5$ out of the $10$ animals cannot enter them. In how many ways is it possible to accommodate the $10$ animals in these $10$ cages?

What is the total number of ways of choosing $4$ cards from a pack of $52$ playing cards? In how many of these are the four cards of the same suit?

Let $m = (9n^2 + 54n + 80)(9n^2 + 45n + 54)(9n^2 + 36n + 35)$. The greatest positive integer which divides $m$ for all positive integers $n$ is:

$A$ five-digit number divisible by $3$ has to be formed using the numerals $0, 1, 2, 3, 4,$ and $5$ without repetition. The total number of ways in which this can be done is:

Vedclass Test Series

Exam Paper Generator

Online Exam Module