subject
Mathematics, 25.11.2019 23:31 melodeelathrom

An elf has a staircase of n stairs to climb. each step it takes can cover either one stair or two stairs. find a recurrence relation for a_n, the number of different ways for the elf to ascend the n-stair staircase. find a recurrence relation for the number or ways the elf in example 2 can climb n stairs if each step covers either one or two or three stairs? how many ways are there for the elf to climb four stairs?

ansver
Answers: 1

Another question on Mathematics

question
Mathematics, 21.06.2019 17:30
Given the points a(-2, 1) and b(8, 6), find the coordinates of the point c on directed line segment ab, that partitions ab in the ration 2: 3.
Answers: 1
question
Mathematics, 21.06.2019 18:30
Which of the following is the true for f(x) = 5cos
Answers: 2
question
Mathematics, 21.06.2019 21:20
An office supply company conducted a survey before marketing a new paper shredder designed for home use. in the survey, 80 % of the people who tried the shredder were satisfied with it. because of this high satisfaction rate, the company decided to market the new shredder. assume that 80 % of all people are satisfied with this shredder. during a certain month, 100 customers bought this shredder. find the probability that of these 100 customers, the number who are satisfied is 69 or fewer.
Answers: 2
question
Mathematics, 22.06.2019 00:00
Which of these angles are supplementary? a. 100o and 90o b. 78o and 102o c. 54o and 146o d. 12o and 78o
Answers: 1
You know the right answer?
An elf has a staircase of n stairs to climb. each step it takes can cover either one stair or two st...
Questions
question
Mathematics, 30.01.2021 03:40
question
Mathematics, 30.01.2021 03:40
Questions on the website: 13722363