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$ set contains $11$ elements. The number of subsets of the set which contain at most $5$ elements is

If ${ }^9 C_3+{ }^9 C_5={ }^{10} C_r$ for some $r \in N$,then $r=$

In how many ways can $12$ balls be distributed between two friends such that one gets $8$ balls and the other gets $4$ balls?

In a conference of $8$ persons,if each person shakes hands with every other person exactly once,then the total number of handshakes is:

If $\binom{n}{r-1} = 36$,$\binom{n}{r} = 84$,and $\binom{n}{r+1} = 126$,then $r = \dots$

Vedclass Test Series

Exam Paper Generator

Online Exam Module