A person wants to climb a $n-$ step staircase using one step or two steps. Let $C_n$ denotes the number of ways of climbing the $n-$ step staircase. Then $C_{18} + C_{19}$ equals
A person wants to climb a $n-$ step staircase using one step or two steps. Let $C_n$ denotes the number of ways of climbing the $n-$ step staircase. Then $C_{18} + C_{19}$ equals
- A
$C_{20}$
- B
$C_{21}$
- C
greater than $C_{21}$
- D
less than $C_{20}$
Similar Questions
Out of $10$ white, $9$ black and $7$ red balls, the number of ways in which selection of one or more balls can be made, is
Out of $10$ white, $9$ black and $7$ red balls, the number of ways in which selection of one or more balls can be made, is
If $a, b$ and $c$ are the greatest value of $^{19} \mathrm{C}_{\mathrm{p}},^{20} \mathrm{C}_{\mathrm{q}}$ and $^{21 }\mathrm{C}_{\mathrm{r}}$ respectively, then
If $a, b$ and $c$ are the greatest value of $^{19} \mathrm{C}_{\mathrm{p}},^{20} \mathrm{C}_{\mathrm{q}}$ and $^{21 }\mathrm{C}_{\mathrm{r}}$ respectively, then
- [JEE MAIN 2020]
There are $15$ persons in a party and each person shake hand with another, then total number of hand shakes is
There are $15$ persons in a party and each person shake hand with another, then total number of hand shakes is
There are $9$ chairs in a room on which $6$ persons are to be seated, out of which one is guest with one specific chair. In how many ways they can sit
There are $9$ chairs in a room on which $6$ persons are to be seated, out of which one is guest with one specific chair. In how many ways they can sit
Two packs of $52$ cards are shuffled together. The number of ways in which a man can be dealt $26$ cards so that he does not get two cards of the same suit and same denomination is
Two packs of $52$ cards are shuffled together. The number of ways in which a man can be dealt $26$ cards so that he does not get two cards of the same suit and same denomination is