For $n \geq 2$,let $S_n$ denote the set of all subsets of $\{1, 2, \ldots, n\}$ such that no two elements are consecutive. For example,$\{1, 3, 5\} \in S_6$,but $\{1, 2, 4\} \notin S_6$. Then $n(S_5)$ is equal to . . . . . . .

  • A
    $13$
  • B
    $14$
  • C
    $15$
  • D
    $16$

Explore More

Similar Questions

If $n = ^mC_2$,then the value of $^nC_2$ is given by

The digit in the unit place of the number $2009! + 3^{7886}$ is

If $S_n = \sum_{r=0}^n \frac{1}{^nC_r}$ and $T_n = \sum_{r=0}^n \frac{r}{^nC_r}$,then $\frac{T_n}{S_n}$ is equal to

Difficult
View Solution

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

Difficult
View Solution

The students $S_{1}, S_{2}, \ldots, S_{10}$ are to be divided into $3$ groups $A, B$ and $C$ such that each group has at least one student and the group $C$ has at most $3$ students. Then the total number of possibilities of forming such groups is ........ .

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