Last visit was: 19 Nov 2025, 05:20 It is currently 19 Nov 2025, 05:20
Close
GMAT 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 GMAT 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.
Close
Request Expert Reply
Confirm Cancel
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,385
Own Kudos:
Given Kudos: 99,977
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,385
Kudos: 778,204
 [25]
Kudos
Add Kudos
25
Bookmarks
Bookmark this Post
User avatar
nick1816
User avatar
Retired Moderator
Joined: 19 Oct 2018
Last visit: 06 Nov 2025
Posts: 1,849
Own Kudos:
8,237
 [2]
Given Kudos: 707
Location: India
Posts: 1,849
Kudos: 8,237
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
ShankSouljaBoi
Joined: 21 Jun 2017
Last visit: 17 Apr 2024
Posts: 622
Own Kudos:
603
 [2]
Given Kudos: 4,090
Location: India
Concentration: Finance, Economics
GMAT 1: 660 Q49 V31
GMAT 2: 620 Q47 V30
GMAT 3: 650 Q48 V31
GPA: 3.1
WE:Corporate Finance (Non-Profit and Government)
Products:
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
avatar
metalhead2593
Joined: 14 Jul 2019
Last visit: 18 Dec 2020
Posts: 31
Own Kudos:
Given Kudos: 322
Posts: 31
Kudos: 31
Kudos
Add Kudos
Bookmarks
Bookmark this Post
nick1816
Total number of ways
= 8C4=70





Bunuel

The GMAT Math Pro logo is stuck on the highest ledge of a nine-story building and must climb down to the single ledge on the bottom row to get to safety. Each move he makes must be to a ledge on the level immediately below him and to the immediate right or left of the ledge on which he’s currently standing. If all available ledges are pictured in the above diagram, how many paths can he take to get to safety?

A. 18
B. 70
C. 128
D. 256
E. 512


Attachment:
GMATLogoLedges.jpg


Can you explain further? Thanks a ton!
User avatar
catinabox
Joined: 27 Nov 2019
Last visit: 18 Nov 2025
Posts: 567
Own Kudos:
588
 [1]
Given Kudos: 223
Location: United States (IL)
GMAT 1: 770 Q50 V44
GPA: 4
Products:
GMAT 1: 770 Q50 V44
Posts: 567
Kudos: 588
 [1]
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
metalhead2593
nick1816
Total number of ways
= 8C4=70





Bunuel

The GMAT Math Pro logo is stuck on the highest ledge of a nine-story building and must climb down to the single ledge on the bottom row to get to safety. Each move he makes must be to a ledge on the level immediately below him and to the immediate right or left of the ledge on which he’s currently standing. If all available ledges are pictured in the above diagram, how many paths can he take to get to safety?

A. 18
B. 70
C. 128
D. 256
E. 512


Attachment:
GMATLogoLedges.jpg


Can you explain further? Thanks a ton!

If you observe the image in the problem, there are a total of 8 steps that the person must take to reach the bottom-most ledge. At each stage of this 8 step journey, the person can take only 2 decisions, whether to go right or to go left. However, since the left and right sides are constrained, i.e. a person can take a maximum of 4 left side jumps and 4 right side jumps, we must arrange these 4 lefts and 4 rights in a total of 8 steps.
Mathematically, 8!/(4!x 4!) (division by 4! twice to account for 4 lefts and 4 rights, similar to how we use this approach in problems on arranging words in a series)
avatar
ouslam
Joined: 04 Apr 2020
Last visit: 25 Mar 2021
Posts: 20
Own Kudos:
20
 [4]
Given Kudos: 72
Posts: 20
Kudos: 20
 [4]
4
Kudos
Add Kudos
Bookmarks
Bookmark this Post
I will try to give a good explanation here

So I will use the combinatorics method to demonstrate nick1816 method

To give you a clue on how we can count , I will assign L and R , meaning that Left and Right , if the guy chooses to go left , I will right L , if right i will write R

One path to reach the bottom is L(to 8th floor) , L(7th) , L(...) , L , R ,R ,R , R(bottom) (use the picture start from the top and then choose left for the first , second , third and fourth step , then you'll have only the right to go to the right bottom ( messing with your head a little).

so I will give you here a hint , all the paths to the bottom need to use 4 Left and 4 right (LRLLLRRR , LRLRLRLR....)
so this problem is a permutation one (Ah ha !!!!!!!!!!!)

since I have 8 choices and 4 repetitions in two sets .

number of roots = 8!/(4! * 4!)= 8C4 =70 Voila !!!!!!!!!!

E is the answer

(permutation rule , to arrange N letters for example , and you have A , B ,C letters repeted X, Y , Z times , then the number of words you can create from this list is N! / (X! * Y! * Z!)

You like the answer ? It's time for Kudos
User avatar
Fdambro294
Joined: 10 Jul 2019
Last visit: 20 Aug 2025
Posts: 1,350
Own Kudos:
Given Kudos: 1,656
Posts: 1,350
Kudos: 741
Kudos
Add Kudos
Bookmarks
Bookmark this Post
This is going to be difficult to describe, but I’ll try my best.

If we count each “slot” as 1 unit, what we essentially have is a rhombus with 4 “slot-units” making up each side.

Shift the entire picture counterclockwise so that the stick man at the top is now in the bottom left corner.

The picture is then the “standard” picture in which the person can only travel East or North until he travels from the bottom-left corner to the upper-right corner of the figure.
However, instead of a perpendicular square, we have a bit of a “stretched” rhombus. The same logic still applies.

No matter which path you take, you will always be making 4 “Eastward” moves and 4 “Northward” moves.

E-E-E-E-N-N-N-N

Then just find the number of ways to arrange the 8 elements, of which 4 “E’s” are identical and 4 “N’s” are identical.

8! / (4! * 4!) = 70 ways

Clever way to alter the common question so as to make it more daunting. Great question!

Posted from my mobile device
User avatar
GmatPoint
Joined: 02 Jan 2022
Last visit: 13 Oct 2022
Posts: 247
Own Kudos:
Given Kudos: 3
GMAT 1: 760 Q50 V42
GMAT 1: 760 Q50 V42
Posts: 247
Kudos: 137
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Whatever path one takes, to reach the single bottom ledge, one has to take 4 left ledges and 4 right ledges.

One of the ways will be LLLLRRRR.

The total number of paths will be all the arrangements of the above path.

Thus, the total number of paths = 8!/4!*4! = 8*7*6*5/4*3*2*1 = 70 ways.

Thus, the correct option is B.
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,584
Own Kudos:
Posts: 38,584
Kudos: 1,079
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
Moderators:
Math Expert
105385 posts
Tuck School Moderator
805 posts