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
The total number of ways in which $5$ balls of different colours can be distributed among $3$ persons so that each person gets at least one ball is
The total number of $5$-digit numbers, formed by using the digits $1, 2, 3, 5, 6, 7$ without repetition, which are multiples of $6$, is
If $f(n) = n! (31-n)!$,where $n \in \{0, 1, 2, \ldots, 31\}$,then the minimum value of $f(n)$ is
The number of integers $n$ such that $100 \leq n \leq 999$ and $n$ contains at most two distinct digits is:
Four-digit numbers with all digits distinct are formed using the digits $1, 2, 3, 4, 5, 6, 7$ in all possible ways. If $p$ is the total number of numbers thus formed and $q$ is the number of numbers greater than $3400$ among them,then $p: q=$
Vedclass Products
For Students
Vedclass Test Series
Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.
Start Free TrialFor Teachers
Exam Paper Generator
Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.
Try FreeFor Institutes
Online Exam Module
Live online exams with unlimited students, 360° analytics & white-label branding.
See Demo