A person wants to climb a n-step staircase us | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(A) To climb an $n$-step staircase,the person can reach the $n$-th step either from the $(n-1)$-th step (by taking one step) or from the $(n-2)$-th st

Vedclass · Accepted Answer

$C_{20}$

Vedclass · Answer

(A) To climb an $n$-step staircase,the person can reach the $n$-th step either from the $(n-1)$-th step (by taking one step) or from the $(n-2)$-th step (by taking two steps).Therefore,the recurrence relation is $C_n = C_{n-1} + C_{n-2}$ for $n \ge 2$.This is the definition of the Fibonacci sequence.Given the recurrence relation $C_n = C_{n-1} + C_{n-2}$,we can substitute $n = 20$ to get $C_{20} = C_{19} + C_{18}$.Thus,$C_{18} + C_{19} = C_{20}$.

$A$ person wants to climb a $n$-step staircase using one step or two steps at a time. Let $C_n$ denote the number of ways of climbing the $n$-step staircase. Then $C_{18} + C_{19}$ equals

Similar Questions

What is the sum of $n$ terms of the series $2 + 5 + 14 + 41 + \dots$?

The value of $1^3 - 2^3 + 3^3 - \dots + 15^3$ is:

The value of $(0.05)^{\log_{\sqrt{20}}(0.1 + 0.01 + 0.001 + \dots)}$ is

The sum of $n$ terms of the series $1^{3}+3^{3}+5^{3}+7^{3}+\ldots$ is

$5^{2}+6^{2}+7^{2}+\ldots+20^{2} =$

Vedclass Test Series

Exam Paper Generator

Online Exam Module