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

$^nC_r + ^nC_{r-1}$ is equal to

The least value of natural number $n$ satisfying $C(n, 5) + C(n, 6) > C(n + 1, 5)$ is

In how many ways can Rs. $16$ be divided among $4$ persons if none of them gets less than Rs. $3$?

Difficult
View Solution

$A$ candidate is required to answer $6$ out of $12$ questions which are divided into two parts $A$ and $B$, each containing $6$ questions. The candidate is not permitted to attempt more than $4$ questions from any part. In how many different ways can he/she make his/her choice of $6$ questions?

$A$ bag contains $3$ coins of one rupee,$4$ coins of fifty paise,and $5$ coins of ten paise. If at least one coin is selected from the bag,what is the total number of ways to make the selection?

Difficult
View Solution

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