{ }^{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

Determine the number of $5 -$ card combinations out of a deck of $52$ cards if each selection of $5$ cards has exactly one king.

$\sum \limits_{ k =0}^6{ }^{51- k } C _3$ is equal to

$\sum\limits_{r = 0}^m {^{n + r}{C_n} = } $

Let $n(A) = 3, \,n(B) = 3$ (where $n(S)$ denotes number of elements in set $S$), then number of subsets of $(A \times B)$ having odd number of elements, is-

How many chords can be drawn through $21$ points on a circle?