Counting the STEPS
There are 101 stairs. Consider the pairs of two consecutive natural numbers starting from 1 as (n+1,n); {for instance (2,1), (4,3), (6,5) and so on}. You have to go UP "n+1" steps, come DOWN "n" steps and repeat this with each pair containing the next two numbers. How many STEPS would it take to reach the top?
Note: Going up and coming down are together to be considered as one STEP(irrespective of the number of steps been climbed). The last STEP would be taken as a whole though it involves only going up.
The answer is 34.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!