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$ linguistic club consists of $6$ girls and $4$ boys. $A$ team of $4$ members is to be selected from this group including the selection of a leader (from among these $4$ members) for the team. If the team has to include at most one boy,the number of ways of selecting the team is

The smallest positive integer $n$,for which $n! < {\left( {\frac{{n + 1}}{2}} \right)^n}$ holds is

$A$ test containing $3$ objective-type questions is conducted in a class. Each question has $4$ options and only one option is the correct answer. No two students of the class have answered identically,and no student has written all correct answers. If every student has attempted all the questions,then the maximum possible number of students who have written the test is:

Let $S$ denote the set of $4$-digit numbers $abcd$ such that $a > b > c > d$ and $P$ denote the set of $5$-digit numbers having the product of its digits equal to $20$. Then $n(S) + n(P)$ is equal to:

The number of different words that can be formed from the letters of the word $SUCCESS$ in which the two $C$ are together but no two $S$ are together are: