Last visit was: 09 May 2024, 22:19 It is currently 09 May 2024, 22:19
Decision Tracker
My Rewards
New comers' posts
New posts
Unanswered

Close

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

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GRE score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Go to My Error Log Learn more
Close

Request Expert Reply

Confirm Cancel
PREVIOUS TOPIC
NEXT TOPIC

A man needs to move up 153 staircase steps to reach the top

Tags :
Find Similar Topics  About  Add a Tag

Show Tags
Hide Tags

avatar
B
thelastzedi
Intern
Intern
Joined: 29 Mar 2023
Posts: 14
Own Kudos [?]: 3 [0]
Given Kudos: 0
Send PM
A man needs to move up 153 staircase steps to reach the top [#permalink] New post   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

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.
UPDATED
User avatar
D
Carcass
Verbal Expert
Joined: 18 Apr 2015
Posts: 28717
Own Kudos [?]: 33266 [0]
Given Kudos: 25207
Send PM
Re: A man needs to move up 153 staircase steps to reach the top [#permalink] New post   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
User avatar
D
Carcass
Verbal Expert
Joined: 18 Apr 2015
Posts: 28717
Own Kudos [?]: 33266 [0]
Given Kudos: 25207
Send PM
Re: A man needs to move up 153 staircase steps to reach the top [#permalink] New post   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
avatar
B
Ola1100
Intern
Intern
Joined: 05 Jan 2023
Posts: 22
Own Kudos [?]: 16 [1]
Given Kudos: 35
GRE 1: Q164 V160
Send PM
Re: A man needs to move up 153 staircase steps to reach the top [#permalink] New post   06 Apr 2023, 00:04
1
I chose 7 because it is not a multiple of 3. As such, if it is multiplied by 2, and subtracted from 153 we have the following:

153 - 7*2 = 153- 14 = 139

139 is not divisible by 3 and hence he could not have taken 2 steps 7 times and taken 3 steps at once a whole number of times.

Am I correct?

Please let me know.
User avatar
D
Carcass
Verbal Expert
Joined: 18 Apr 2015
Posts: 28717
Own Kudos [?]: 33266 [0]
Given Kudos: 25207
Send PM
Re: A man needs to move up 153 staircase steps to reach the top [#permalink] New post   06 Apr 2023, 00:37
Expert Reply
You are correct but technically that problem should work this way

https://quanticdev.com/algorithms/dynam ... -problems/
Prep Club for GRE Bot
gmatclubot
[#permalink]
Moderators:
BrushMyQuant
Moderator
1085 posts
VibhuAnurag
GRE Instructor
218 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne

Main navigation

Partners

GRE Resources

www.ets.org/gre | About | Terms and Conditions and Privacy Policy | Prep Club for GRE Rules | Contact