{ }^{n-1} C_r=left(k^2-8right){ }^n C_{r+1} i | vedclass

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

Question

$ { }^{n-1} C_r=(k^2-8){ }^n C_{T+1} $

$\underbrace{r+1 \geq 0, \quad r \geq 0}_{r \geq 0}$

$\frac{{ }^{n-1} C_{\mathrm{r}}}{{ }^n C_{\mathrm{r}

Vedclass · Accepted Answer

$2 \sqrt{2}<\mathrm{k} \leq 3$

Vedclass · Answer

$ { }^{n-1} C_r=(k^2-8){ }^n C_{T+1} $

$\underbrace{r+1 \geq 0, \quad r \geq 0}_{r \geq 0}$

$\frac{{ }^{n-1} C_{\mathrm{r}}}{{ }^n C_{\mathrm{r}+1}}=\mathrm{k}^2-8$

$\frac{\mathrm{r}+1}{\mathrm{n}}=\mathrm{k}^2-8$

$\Rightarrow \mathrm{k}^2-8>0$

$(\mathrm{k}-2 \sqrt{2})(\mathrm{k}+2 \sqrt{2})>0$

$\mathrm{k} \in(-\infty,-2 \sqrt{2}) \cup(2 \sqrt{2}, \infty)$   $......(I)$

$	herefore \mathrm{n} \geq \mathrm{r}+1, \frac{\mathrm{r}+1}{\mathrm{n}} \leq 1$

$ \Rightarrow \mathrm{k}^2-8 \leq 1 $

$\mathrm{k}^2-9 \leq 0$

$ -3 \leq \mathrm{k} \leq 3 $                              $......(II)$

From equation $(I)$ and $(II)$ we get

$\mathrm{k} \in[-3,-2 \sqrt{2}) \cup(2 \sqrt{2}, 3]$

${ }^{n-1} C_r=\left(k^2-8\right){ }^n C_{r+1}$ if and only if:

Similar Questions

The number of ways of dividing $52$ cards amongst four players equally, are

$^n{P_r}{ \div ^n}{C_r}$ =

At an election, a voter may vote for any number of candidates, not greater than the number to be elected. There are $10$ candidates and $4$ are of be selected, if a voter votes for at least one candidate, then the number of ways in which he can vote is

The number of ways in which five identical balls can be distributed among ten identical boxes such that no box contains more than one ball, is

Let $S=\{1,2,3,5,7,10,11\}$. The number of nonempty subsets of $S$ that have the sum of all elements a multiple of $3$ , is $........$