The solution set of ^{10}C_{x-1} 2 cdot ^{1 | vedclass

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

Question

(C) Given inequality: $^{10}C_{x-1} > 2 \cdot ^{10}C_x$ Using the formula $^{n}C_r = \frac{n!}{r!(n-r)!}$,we have: $ \frac{10!}{(x-1)!(10-(x-1))!} > 2

Vedclass · Accepted Answer

$ \{8, 9, 10\} $

Vedclass · Answer

(C) Given inequality: $^{10}C_{x-1} > 2 \cdot ^{10}C_x$ Using the formula $^{n}C_r = \frac{n!}{r!(n-r)!}$,we have: $ \frac{10!}{(x-1)!(10-(x-1))!} > 2 \cdot \frac{10!}{x!(10-x)!} $ $ \frac{1}{(x-1)!(11-x)!} > \frac{2}{x!(10-x)!} $ Since $x! = x \cdot (x-1)!$ and $(11-x)! = (11-x) \cdot (10-x)!$,we get: $ \frac{1}{(11-x)(10-x)!} > \frac{2}{x(10-x)!} $ $ \frac{1}{11-x} > \frac{2}{x} $ Since $x$ must be a positive integer such that $1 \le x \le 10$,we have $x > 22 - 2x \implies 3x > 22 \implies x > 7.33$. Thus,the possible integer values for $x$ are $8, 9, 10$. Therefore,the solution set is $\{8, 9, 10\}$.

The solution set of $^{10}C_{x-1} > 2 \cdot ^{10}C_x$ is

Similar Questions

The number of ways in which an examiner can assign $30$ marks to $8$ questions,awarding not less than $2$ marks to any question is

$A$ student is required to answer $10$ questions out of $13$ in an examination,such that he must choose at least $4$ questions from the first $5$ questions. How many ways can he make the selection?

The number of elements in the set $S = \{(r, k) : k \in Z \text{ and } ^{36}C_{r+1} = \frac{6(^{35}C_r)}{(k^2-3)}\}$ is:

$A$ group consists of $4$ girls and $7$ boys. In how many ways can a team of $5$ members be selected if the team has at least $3$ girls?

$A$ man has $10$ friends. In how many ways can he invite one or more of them to a party?

Vedclass Test Series

Exam Paper Generator

Online Exam Module