Mathematics
Angaan wants to climb an 8-step staircase. His playful rule is that he can take either 1 step or 2 steps at a time. For example, one of his paths is 1, 2, 2, 1, 2. In how many different ways can he reach the top?
Number Play
1 Like
Answer
We can count directly by grouping the paths according to how many 2-steps are used:
No 2-step (eight 1-steps): 1 way
One 2-step (with six 1-steps): 7 ways
Two 2-steps (with four 1-steps): 15 ways
Three 2-steps (with two 1-steps): 10 ways
Four 2-steps (no 1-step): 1 way
Total = 1 + 7 + 15 + 10 + 1 = 34 ways.
Hence, Angaan can reach the top of the 8-step staircase in 34 different ways.
Answered By
3 Likes
Related Questions
What is the parity of the sum of the numbers from 1 to 100?
Two consecutive numbers in the Virahāṅka sequence are 987 and 1597. What are the next 2 numbers in the sequence? What are the previous 2 numbers in the sequence?
What is the parity of the 20th term of the Virahāṅka sequence?
Identify the statements that are true.
(a) The expression 4m – 1 always gives odd numbers.
(b) All even numbers can be expressed as 6j – 4.
(c) Both expressions 2p + 1 and 2q – 1 describe all odd numbers.
(d) The expression 2f + 3 gives both even and odd numbers.