You are here
Question 8 - Figure it out - Page 143, 144 - Chapter 6 Class 7 - Number Play - Ganita Prakash
Last updated at October 17, 2025 by Teachoo
Class 7 (Ganita Prakash 1, 2 & old NCERT)
Chapter 6 Class 7 - Number Play - Ganita Prakash
- Numbers can Tell us Things, Supercells
- Parity
- Figure it out - Page 131
- Small Squares in Grids (Parity in Multiplication)
- Parity of Expressions
- Some Explorations in Grids
- Magic Square
- Figure it out - Page 136
- Generalising 3 × 3 Magic Square
- First ever 4 × 4 Magic Square
- Magic Squares in History and Culture
- Virahāṅka Fibonacci Numbers
- Digits in Disguise
-
Figure it out - Page 143, 144
Transcript
Question 8 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? We can make a table for this Steps to climb All possible ways Number of ways 1 (1) 1 2 (1+1), (2) 2 3 3 4 5 5 combine step 4 & 8 6 13 7 21 8 34This problem is a real-world example of the Virahāńka sequence. The number of ways to climb n steps by taking 1 or 2 steps at a time is the nth term of the sequence 1, 2, 3, 5, 8, .... We need to find the 8th term. The sequence is: 1, 2, 3, 5, 8, 13, 21, 34 8th term = 34 Thus, he can reach the top in 34 different ways.
