Bunuel
How many arrangements of the digits 1, 2, 3, 4, and 5 are there, such that 2 and 4 are not adjacent?
A. 112
B. 96
C. 72
D. 24
E. 6
Take the task of seating the 5 digits and break it into
stages.
Stage 1: Arrange the 1, 3 and 5Since n unique objects can be arranged in n! ways, we can arrange these 3 digits in 3! (6) ways.
We can complete stage 1 in
6 ways.
Key step: For each arrangement of the 3 digits, add a space on each side of each digit. So, for example, if we add spaces to the arrangement 153, we get: _1_5_3_ Each of the 4 spaces represents a possible location for the two remaining digits (2 and 4). Notice that this configuration ensures that the 2 and 4 can't be adjacent.
Stage 2: Choose a space to place the 2. There are 4 available spaces, so we can complete stage 2 in
4 ways.
Stage 3: Choose a space to place the 4. There are 3 available spaces remaining, so we can complete stage 3 in
3 ways.
At this point, we'll throw away the remaining spaces, leaving an arrangement with all 5 digits.
By the Fundamental Counting Principle (FCP), the number of ways to complete all 4 stages (and thus place all 8 letters) = (
6)(
4)(
3) =
72 ways Answer: C
Note: the FCP can be used to solve the MAJORITY of counting questions on the GMAT. So, be sure to learn it.
RELATED VIDEO