If the total number of $m$-element subsets of the set $A = \{a_{1}, a_{2}, \ldots, a_{n}\}$ is $k$ times the number of $m$-element subsets containing $a_{4}$, then $n$ is

  • A
    $(m-1)k$
  • B
    $mk$
  • C
    $(m+1)k$
  • D
    $(m+2)k$

Explore More

Similar Questions

Determine $n$ if $^{2n}C_{3} : ^{n}C_{3} = 11 : 1$.

$A$ scientific committee is to be formed from $6$ Indians and $8$ foreigners,which includes at least $2$ Indians and double the number of foreigners as Indians. Then the number of ways,the committee can be formed,is

There are $5$ apples,$4$ mangoes,$3$ oranges,and $1$ each of $2$ other varieties of fruits. The number of ways of selecting at least one fruit of each kind is

An urn contains $5$ red marbles,$4$ black marbles and $3$ white marbles. The number of ways in which $4$ marbles can be drawn so that at most three of them are red is

In how many ways can a student choose a programme of $5$ courses if $9$ courses are available and $2$ specific courses are compulsory for every student?

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo