There are $15$ stations on a train route and the train has to be stopped at exactly $5$ stations among these $15$ stations. If it stops at at least two consecutive stations,then the number of ways in which the train can be stopped is

  • A
    ${ }^{11} C_5$
  • B
    ${ }^{15} C_5$
  • C
    ${ }^{15} C_5 - { }^{11} C_5$
  • D
    ${ }^{15} C_{10} - { }^9 C_5$

Explore More

Similar Questions

$A$ question paper has $3$ parts $A, B, C$. Part $A$ contains $7$ questions,part $B$ contains $5$ questions,and part $C$ contains $3$ questions. If a candidate is allowed to answer not more than $4$ questions from part $A$,not more than $3$ questions from part $B$,and not more than $2$ questions from part $C$,then the number of ways in which a candidate can answer exactly $7$ questions is

The number of permutations of all the letters $AAAABBBC$ in which all the $A$'s appear together in a block of $4$ letters or all the $B$'s appear together in a block of $3$ letters,is-

$A$ group of students comprises $5$ boys and $n$ girls. If the number of ways,in which a team of $3$ students can be randomly selected from this group such that there is at least one boy and at least one girl in each team,is $1750$,then $n$ is equal to

How many words can be formed using $3$ consonants and $2$ vowels from $5$ consonants and $4$ vowels?

The number of times the digit $5$ will be written when listing the integers from $1$ to $1000$ is

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