GRE Prep Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
A man needs to move up 153 staircase steps to reach the top
[#permalink]
Updated on: 05 Apr 2023, 11:53
Updated on: 05 Apr 2023, 11:53
00:00
Question Stats:
100% (00:08) correct
0% (00:00) wrong based on 1 sessions
Hide Show timer Statistics
A man needs to move up 153 staircase steps to reach the top. If he can climb either three steps or two steps at a time, which of the following CANNOT be the number of two steps taken by the man?
3
6
7
12
15
3
6
7
12
15
Originally posted by thelastzedi on 05 Apr 2023, 11:49.
Last edited by Carcass on 05 Apr 2023, 11:53, edited 1 time in total.
Last edited by Carcass on 05 Apr 2023, 11:53, edited 1 time in total.
UPDATED
Re: A man needs to move up 153 staircase steps to reach the top
[#permalink]
05 Apr 2023, 11:55
05 Apr 2023, 11:55
Expert Reply
The problem must be posted under the one-answer choice question (problem-solving) NOT the quantitative comparison question sub-forum.
Also, the title is better with the same words of the stem.
Please read the rules of the forum before posting a new question
Also, the title is better with the same words of the stem.
Please read the rules of the forum before posting a new question
Re: A man needs to move up 153 staircase steps to reach the top
[#permalink]
05 Apr 2023, 15:02
05 Apr 2023, 15:02
Expert Reply
It does not seem a GRe problem because the problem with stair are a recursive problem in wich the Fibonacci-like sequence is involved
