If ^nC_3 + ^nC_4 ^{n+1}C_3,then | vedclass

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

Question

(A) We use the Pascal's identity: $^nC_r + ^nC_{r-1} = ^{n+1}C_r$.Applying this to the given inequality: $^nC_3 + ^nC_4 = ^{n+1}C_4$.So,the inequality

Vedclass · Accepted Answer

$n > 6$

Vedclass · Answer

(A) We use the Pascal's identity: $^nC_r + ^nC_{r-1} = ^{n+1}C_r$.Applying this to the given inequality: $^nC_3 + ^nC_4 = ^{n+1}C_4$.So,the inequality becomes: $^{n+1}C_4 > ^{n+1}C_3$.Expanding the combinations: $\frac{(n+1)!}{4!(n-3)!} > \frac{(n+1)!}{3!(n-2)!}$.Dividing both sides by $(n+1)!$ and simplifying the factorials:$\frac{1}{4 	imes 3!(n-3)!} > \frac{1}{3!(n-2)(n-3)!}$.$\frac{1}{4} > \frac{1}{n-2}$.Since $n > 3$ for the combinations to be defined,$n-2$ is positive,so we can cross-multiply:$n - 2 > 4$.$n > 6$.

If $^nC_3 + ^nC_4 > ^{n+1}C_3$,then

Similar Questions

For $2 \le r \le n$,the expression $\binom{n}{r} + 2\binom{n}{r-1} + \binom{n}{r-2}$ is equal to:

The value of $r$ for which $^{15}C_{r + 3} = {}^{15}C_{2r - 6}$ is:

If $a, b$ and $c$ are the greatest values of $^{19}C_{p}, ^{20}C_{q}$ and $^{21}C_{r}$ respectively,then

The total number of possible ways in which a person can go from point $A(0,0)$ to point $B(3,3)$ if they can travel only to the right or upward along the grid lines is equal to:

Each section in the first year of a plus $2$ course has exactly $40$ students. If there are $5$ sections,in how many ways can a set of $4$ student representatives be selected,$1$ from each section?

Vedclass Test Series

Exam Paper Generator

Online Exam Module