gmatt1476

In the figure above, X and Y represent locations in a district of a certain city where the streets form a rectangular grid. In traveling only north or east along the streets from X to Y, how many different paths are possible?
A. 720
B. 512
C. 336
D. 256
E. 56
PS61551.01
Attachment:
2019-09-21_1421.png
If we define paths from X to Y in a block-by-block manner, we can see that any route from X to Y will consist of 3 NORTHS and 5 EASTS.
For example, this particular path....

... can be defined as ENENEEEN (where E stands for 1 block east, and N stands for 1 block north.
Similarly, this path...

... can be defined as NNENEEEE
So our question becomes, "
In how many different ways can we arrange 3 N's and 5 E's?"
-----------ASIDE-----------------
When we want to arrange a group of items in which some of the items are identical, we can use something called the MISSISSIPPI rule. It goes like this:
If there are n objects where A of them are alike, another B of them are alike, another C of them are alike, and so on, then the total number of possible arrangements = n!/[(A!)(B!)(C!)....] So, for example, we can calculate the number of arrangements of the letters in MISSISSIPPI as follows:
There are
11 letters in total
There are
4 identical I's
There are
4 identical S's
There are
2 identical P's
So, the total number of possible arrangements =
11!/[(
4!)(
4!)(
2!)]
---------------------------------
Now let's apply the MISSISSIPPI rule to arranging 3 N's and 5 E's
There are
8 letters in total
There are
3 identical N's
There are
5 identical E's
So, the total number of possible arrangements =
8!/[(
3!)(
5!)] = 56
Answer: E
Cheers,
Brent