ardz24 wrote:Runners V, W, X, Y, and Z are competing in the Bayville local triathlon. If V finishes before W and W finishes before Z, how many ways can X finish before Y??

A. 5
B. 10
C. 30
D. 60
E. 120

Take the task of arranging the 5 runners and break it into stages.

GIVEN: V finishes before W and W finishes before Z
So, the order is: Z - W - V
Our goal is to now place the remaining 2 runners (runner X and runner Y)

NOTE: I'm going to IGNORE the restriction that says X must finish before Y
You'll see why shortly.

Stage 1: place runner X into the existing order.
Notice that if we already have the arrangement Z - W - V, then we can place spaces in the areas where runner X might go.
We have: _Z_W_V_
Since there are 4 spaces where we can place runner X, we can complete stage 1 in 4 ways

Stage 2: place runner Y into the existing order.
At this point, we have placed runners Z, W, V and X
Let's pretend for a moment, that the arrangement is ZXWV
From here, we can place spaces in the areas where runner Y might go.
We have: _Z_X_W_V_
Since there are 5 spaces where we can place runner Y, we can complete stage 2 in 5 ways

By the Fundamental Counting Principle (FCP), we can the 2 stages (and thus arrange all 5 runners) in (4)(5) ways (= 20 ways)

IMPORTANT: If we IGNORE the restriction that says X must finish before Y, then there are 20 possible arrangements.
However, in HALF of those 20 arrangements, X is ahead of Y, and in the other HALF of those 20 arrangements, Y is ahead of X.

So, the number of arrangements in which X is ahead of Y = 20/2 = 10

Answer: B
--------------------------

Note: the FCP can be used to solve the MAJORITY of counting questions on the GMAT. For more information about the FCP, watch our free video: https://www.gmatprepnow.com/module/gmat- ... /video/775

You can also watch a demonstration of the FCP in action: https://www.gmatprepnow.com/module/gmat ... /video/776

Then you can try solving the following questions:

EASY
- https://www.beatthegmat.com/what-should- ... 67256.html
- https://www.beatthegmat.com/counting-pro ... 44302.html
- https://www.beatthegmat.com/picking-a-5- ... 73110.html
- https://www.beatthegmat.com/permutation- ... 57412.html
- https://www.beatthegmat.com/simple-one-t270061.html


MEDIUM
- https://www.beatthegmat.com/combinatoric ... 73194.html
- https://www.beatthegmat.com/arabian-hors ... 50703.html
- https://www.beatthegmat.com/sub-sets-pro ... 73337.html
- https://www.beatthegmat.com/combinatoric ... 73180.html
- https://www.beatthegmat.com/digits-numbers-t270127.html
- https://www.beatthegmat.com/doubt-on-sep ... 71047.html
- https://www.beatthegmat.com/combinatoric ... 67079.html


DIFFICULT
- https://www.beatthegmat.com/wonderful-p- ... 71001.html
- https://www.beatthegmat.com/permutation- ... 73915.html
- https://www.beatthegmat.com/permutation-t122873.html
- https://www.beatthegmat.com/no-two-ladie ... 75661.html
- https://www.beatthegmat.com/combinations-t123249.html


Cheers,
Brent

ardz24 wrote:Runners V, W, X, Y, and Z are competing in the Bayville local triathlon. If V finishes before W and W finishes before Z, how many ways can X finish before Y??

A. 5
B. 10
C. 30
D. 60
E. 120

Another option is to systematically list and count the possible outcomes
To begin, Z, W and V must have the following order: Z-W-V

Now insert an X and a Y so that X is ahead of Y.
We get:
1) YZWVX
2) ZYWVX
3) ZWYVX
4) ZWVYX
5) YZWXV
6) ZYWXV
7) ZWYXV
8) YZXWV
9) ZYXWV
10) YXZWV

Answer: B

Cheers,
Brent