Question 14 Marks
For $\mathrm{n} \geq 2$, let $S_{n}$ denote the set of all subsets of $\{1,2 \ldots \ldots ., n\}$ with no two consecutive numbers. For example $\{1,3,5\} \in \mathrm{S}_{6}$, but $\{1,2,4\} \notin \mathrm{S}_{6}$. Then $n\left(S_{5}\right)$ is equal to __________.
Answer
View full question & answer→13
$\mathrm{A}=\{1,2,3,4,5 \ldots \ldots \mathrm{n}\}$
No. of subsets having $r$ elements such that no two are consecutive is $={ }^{n-r+1} C_{r}$
for $\mathrm{n}=5$, no. of ways $={ }^{6-r} \mathrm{C}_{\mathrm{r}}$
Subsets having no element $=1$
Subsets having exactly 1 element $={ }^{5} \mathrm{C}_{1}=5$
Subsets having exactly 2 element $={ }^{4} \mathrm{C}_{2}=6$
Subsets having exactly 3 element $={ }^{3} \mathrm{C}_{3}=1$
$\Rightarrow 5+6+1+1=13$
$\mathrm{A}=\{1,2,3,4,5 \ldots \ldots \mathrm{n}\}$
No. of subsets having $r$ elements such that no two are consecutive is $={ }^{n-r+1} C_{r}$
for $\mathrm{n}=5$, no. of ways $={ }^{6-r} \mathrm{C}_{\mathrm{r}}$
Subsets having no element $=1$
Subsets having exactly 1 element $={ }^{5} \mathrm{C}_{1}=5$
Subsets having exactly 2 element $={ }^{4} \mathrm{C}_{2}=6$
Subsets having exactly 3 element $={ }^{3} \mathrm{C}_{3}=1$
$\Rightarrow 5+6+1+1=13$
