BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Maze Problem?

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
Master | Next Rank: 500 Posts
Posts: 110
Joined: Sat Feb 11, 2012 5:01 am
Thanked: 2 times

Maze Problem?

by rajatvmittal » Mon Mar 12, 2012 7:27 am
a) If you are required to walk from intersection A
to intersection B along a route that is confined
to the square grid of four avenues and three
streets shown in the map above, how many
routes from A to B can you take that have the
minimum possible length ?

What if 4 avenues and 4 streets.

What if 5 avenues and 3 streets

What if 4 avenues and 5 streets?

Just want to know method to calculate???
Top
Source: — Problem Solving |
Senior | Next Rank: 100 Posts
Posts: 92
Joined: Thu Oct 06, 2011 8:06 am
Thanked: 18 times

by Neo Anderson » Mon Mar 12, 2012 9:07 am
If you are required to walk from intersection A
to intersection B along a route that is confined
to the square grid of four avenues and three
streets shown in the map above, how many
routes from A to B can you take that have the
minimum possible length ?
number of avenues and streets are given, you only have to arrange them in different order, when you know total number of avenues and streets to reach the destination is also unique.
as in: say avenues (A) are 4 and streets(3) are 3
just have to arrange AAAASSS in various ways, thus 7!/(4!x3!) = 35 ways
Top
Master | Next Rank: 500 Posts
Posts: 110
Joined: Sat Feb 11, 2012 5:01 am
Thanked: 2 times

by rajatvmittal » Mon Mar 12, 2012 9:12 am
What if 4 avenues and 4 streets. : - Is it 8!/4!*4!

What if 5 avenues and 3 streets : - is it 8!/5!*3!

What if 4 avenues and 5 streets? : - is it 9!/5!*4!
Am i Right?
Top
Senior | Next Rank: 100 Posts
Posts: 92
Joined: Thu Oct 06, 2011 8:06 am
Thanked: 18 times

by Neo Anderson » Mon Mar 12, 2012 9:13 am
absolutely right!
Top
Post new topic Post Reply
• Page 1 of 1