**The Stairs Riddle - 17 July**

You need to climb ten stairs. At every stair, you can either take one step up or you can jump two steps up.

In how many different ways you can climb 10 stairs?

**For Solution :**Click Here

This Blog is a collection of brain teasers, puzzles (maths,fun,brain etc), riddles,Questions, Quiz.

You need to climb ten stairs. At every stair, you can either take one step up or you can jump two steps up.

In how many different ways you can climb 10 stairs?

Subscribe to:
Post Comments (Atom)

Difficulty Level 3/5
(726)
Logic Puzzles
(483)
Difficulty Level 4/5
(457)
Riddles
(364)
Difficulty Level 2/5
(358)
Maths Puzzles
(344)
Picture Puzzles
(330)
Trick Teasers
(282)
Popular Puzzles
(212)
Rebus Puzzles
(155)
Humor Puzzles
(151)
Interview Puzzle
(124)
Series Puzzles
(124)
What Word Am I
(99)
Difficulty Level 1/5
(90)
Trivia
(76)
Mystery Puzzles
(73)
Equation Puzzles
(72)
Difficulty level 5/5
(53)
Murder Mystery Puzzles
(43)
Square Count
(40)
Probability Puzzles
(39)
Who Am I
(39)
IAS-EXAMS
(34)
Cipher Puzzles
(32)
Algebra
(31)
Science Puzzles
(30)
Situation Puzzles
(28)
Puzzles of Age
(21)
Read Between Lines Puzzles
(18)
Google Interview Puzzle
(17)
MatchSticks-Riddles
(15)
Microsoft Interview Puzzles
(15)
statement
(15)
Time Distance Problem
(14)
Odd One Out
(13)
Relationship Puzzles
(11)
Cards
(10)
Story Puzzles
(10)
Paradox Puzzles
(9)
Classic
(6)
Directional Puzzles
(6)
Best Of 2011
(5)
clever
(5)
Brain-Twister
(4)
Mind Games
(4)
Analytical
(3)
What Does This Text Mean
(3)
CHALLENGING
(2)
Double Meaning
(2)
chess
(2)
Acronym
(1)
Measure
(1)
Suduko
(1)
Video Riddle
(1)
coin-Puzzles
(1)
m
(1)
pop
(1)
triv
(1)

For 1 step we have one option. 1 step

ReplyDeleteFor 2 Steps we have 2 options 1,1 or 2

For 3 steps we have 3 options

1,1,1

2,1

1,2.

The important thing to note is that we must always go up in 2 or 1 steps. So the final step is always 1 step or 2.

So if Fn is the number of ways to climb ten stairs the final steps will alays be Fn=Fn-1 + Fn+2. This is the fibonachi sequence. It must have seed values that F1=1 and F2=1

So F3=F3-1 +F3-2 so F3=F2+F1 f3=1+1 =2

sO

f1=1

F2=1 The answer for 1 stairs

F3=2 the answer for 2 stairs

f4=3 the answer for 3 stairs

similarly then the answer for 10 stairs will be equal to F11 which is equal to the tenth plus the 9th fibonachi numbers.

F11=F10+F9

f11=34+55

F11=89 the number of possible combinations.