The least value of n such that { }^{(n-1)} C_ | vedclass

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

Question

(C) Given the inequality: ${ }^{(n-1)} C_3 + { }^{(n-1)} C_4 > { }^n C_3$ Using the Pascal's identity ${ }^n C_{r-1} + { }^n C_r = { }^{n+1} C_r$,we h

Vedclass · Accepted Answer

$8$

Vedclass · Answer

(C) Given the inequality: ${ }^{(n-1)} C_3 + { }^{(n-1)} C_4 > { }^n C_3$ Using the Pascal's identity ${ }^n C_{r-1} + { }^n C_r = { }^{n+1} C_r$,we have: ${ }^{(n-1)} C_3 + { }^{(n-1)} C_4 = { }^n C_4$ Substituting this into the inequality: ${ }^n C_4 > { }^n C_3$ Expanding the combinations: $\frac{n!}{4!(n-4)!} > \frac{n!}{3!(n-3)!}$ Since $n! > 0$,we can divide both sides by $n!$: $\frac{1}{4!(n-4)!} > \frac{1}{3!(n-3)!}$ $\frac{1}{4 	imes 3! 	imes (n-4)!} > \frac{1}{3! 	imes (n-3) 	imes (n-4)!}$ $\frac{1}{4} > \frac{1}{n-3}$ Since $n-3 > 0$ (as $n \ge 4$),we can cross-multiply: $n - 3 > 4$ $n > 7$ Therefore,the least integer value of $n$ is $8$.

The least value of $n$ such that ${ }^{(n-1)} C_3 + { }^{(n-1)} C_4 > { }^n C_3$ is:

Similar Questions

$A$ team of $11$ players is to be selected from $22$ players. If $2$ specific players must be included in every team and $4$ specific players must always be excluded,in how many ways can this selection be made?

The number of ways in which one or more balls can be selected out of $10$ white,$9$ green,and $7$ blue balls is:

There are $10$ bulbs in a room. Each of them can be switched on independently. In how many ways can the room be illuminated?

If $^nC_4, ^nC_5,$ and $^nC_6$ are in $A.P.,$ then $n$ can be

The value of ${}^{50}C_4 + \sum_{r=1}^{6} {}^{56-r}C_3$ is

Vedclass Test Series

Exam Paper Generator

Online Exam Module