Gmat quant topic 7 p and c sol

1. 4!, 8!/2!
2.
7
P4
3.
4
P2 +
4
P3 +
4
P4
4. 4!/2!
5.
10
P2 +
10
P3
6. (
10
P8 +
10
P9 +
10
P10) × 12 seconds
7. 6! – 5! × 2!
8.
7
C4
9.
12
C9
10.
2
C1 ×
3
C1 × (
7
C4 –
5
C2)
11. (
5
C3 –
3
C1) × 3!
12. (4! / 2!) × 2!
13.
7
C3
14.
7
P3
15. 5! / 2!
16.
4
P3
17. 4 × 4 = 16
18. Another version: 2 ×
5
C4 × 2 = 20
19. (3 ! × 2 ! × 3 !) × 3 !
20. 3 ! × 2 !
21. 1 × 10 × 10 × 5
22.
5
C3 ×
4
C3
23. 5 ! × 2 !
24.
5
C3 +
5
C4
25.
3
C2 × 1 ×
3
C2
26. 3 ! × 2 ! × 2 ! × 2 !
27. TTTHHH, HTTTHH, HHTTTH, HHHTTT; total 4
28. The only combination of odd is 5 × 5 × 5. So total required = 3 × 3 × 3 – 1 = 26.
29.
6
P4 × 2 = 720
30. 2 × 2 × 2 × 4 × 4 – 2 × 1 × 1 × 4 × 4 = 96
31. 10
32. 3 ! × 3 ! = 36
33.
6
C2 × 9 × 3 = 405 seconds
34. 9 ! / 5! × 4!
35. 6 × 2 × 1 × 3 × 2 × 1 = 72
36. (5! / 2! – 4! / 2!) = 48.
37. In order to answer this question, we need to be able to determine the value of x. Thus, this question can
be rephrased: What is x?
GMAT / Quant / P&C / Page 1 of 4

(1) SUFFICIENT: In analyzing statement (1), consider how many individuals would have to be
available to create 126 different 5 person teams. We don't actually have to figure this out as long as we
know that we could figure this out. Certainly by testing some values, we could figure this out. It turns
out that if there are 9 available individuals, then we could create exactly 126 different 5-person teams
(since 9! ÷ [(5!)(4!)] = 126). This value (9) represents x + 2. Thus x would equal 7.
(2) SUFFICIENT: The same logic applies to statement (2). Consider how many individuals would have
to be available to create 56 different 3-person teams. Again, we don't actually have to figure this out as
long as we know that we could figure this out. It turns out that if there are 8 available individuals, then
we could create exactly 56 different 3-person teams (since 8! ÷ [(5!)(3!)] = 56). This value (8) represents
x + 1. Thus x would equal 7. Statement (2) alone IS sufficient.
The correct answer is D.
38. This question is simply asking us to come up with the number of permutations that can be formed
when x people are seated in y chairs. It would seem that all we require is the values of x and y. Let's keep
in mind that the question stem adds that x and y must be prime integers.
(1) SUFFICIENT: If x and y are prime numbers and add up to 12, x and y must be either 7 and 5 or 5
and 7. Would the number of permutations be the same for both sets of values? Let's start with x = 7, y =
5. The number of ways to seat 7 people in 5 positions (chairs) is 7!/2!. We divide by 2! because 2 of the
people are not selected in each seating arrangement and the order among those two people is therefore
not significant. An anagram grid for this permutation would look like this:
A B C D E F G
1 2 3 4 5 N N
But what if x = 5 and y = 7? How many ways are there to position five people in 7 chairs? It turns out
the number of permutations is the same. One way to think of this is to consider that in addition to the
five people (A,B,C,D,E), you are seating two ghosts (X,X). The number of ways to seat A,B,C,D,E,X,X
would be 7!/2!. We divide by 2! to eliminate order from the identical X's.
Another way to look at this is by focusing on the chairs as the pool from which you are choosing. It's as
if we are fixing the people in place and counting the number of ways that different chair positions can be
assigned to those people. The same anagram grid as above would apply, but now the letters would
correspond to the 7 chairs being assigned to each of the five fixed people. Two of the chairs would be
unassigned, and thus we still divide by 2! to eliminate order between those two chairs.
(2) INSUFFICIENT: This statement does not tell us anything about the values of x and y, other than y >
x. The temptation in this problem is to think that you need statement 2 in conjunction with statement 1 to
distinguish between the x = 5, y = 7 and the x = 7, y = 5 scenarios.
The correct answer is A: Statement (1) ALONE is sufficient to answer the question, but statement (2)
alone is not.
39. Let W be the number of wins and L be the number of losses. Since the total number of hands equals 12
and the net winnings equal $210, we can construct and solve the following simultaneous equations: w +
l = 12, 100 w – 10 l = 210. so l = 9, w = 3. So we know that the gambler won 3 hands and lost 9. We do
not know where in the sequence of 12 hands the 3 wins appear. So when counting the possible outcomes
for the first 5 hands, we must consider these possible scenarios:
1) Three wins and two losses 2) Two wins and three losses 3) One win and four losses 4) No wins
and five losses
In the first scenario, we have WWWLL. We need to know in how many different ways we can arrange
these five letters:

5!/2!3! = 10. So there are 10 possible arrangements of 3 wins and 2 losses. The second scenario --
WWLLL -- will yield the same result: 10. The third scenario -- WLLLL -- will yield 5 possible
arrangements, since the one win has only 5 possible positions in the sequence. The fourth scenario --
LLLLL -- will yield only 1 possible arrangement, since rearranging these letters always yields the same
sequence. Altogether, then, there are 10 + 10 + 5 + 1 = 26 possible outcomes for the gambler's first five
hands. The correct answer is C.

40.
First, let's consider the different medal combinations that can be awarded to the 3 winners: (1) If there are NO
TIES then the three medals awarded are: GOLD, SILVER, BRONZE. (2) What if there is a 2-WAY tie? --If
there is a 2-WAY tie for FIRST, then the medals awarded are: GOLD, GOLD, SILVER. --If there is a 2-WAY
tie for SECOND, then the medals awarded are: GOLD, SILVER, SILVER. --There cannot be a 2-WAY tie for
THIRD (because exactly three medals are awarded in total). (3) What if there is a 3-WAY tie? --If there is a 3-
WAY tie for FIRST, then the medals awarded are: GOLD, GOLD, GOLD. --There are no other possible 3-
WAY ties. Thus, there are 4 possible medal combinations: (1) G, S, B (2) G, G, S (3) G, S, S (4) G, G, G. Now
let's determine how many different ways each combination can be distributed. We'll do this by considering four
runners: Albert, Bob, Cami, and Dora.
COMBINATION 1: Gold, Silver, Bronze
Gold Medal Silver Medal Bronze Medal
Any of the 4
runners can
receive the gold
medal.
There are only 3 runners who
can receive the silver medal.
Why? One of the runners has
already been awarded the Gold
Medal.
There are only 2 runners who can
receive the bronze medal. Why?
Two of the runners have already
been awarded the Gold and Silver
medals.
4 possibilities 3 possibilities 2 possibilities
Therefore, there are different victory circles that will contain 1 GOLD, 1 SILVER, and 1
BRONZE medalist.
COMBINATION 2: Gold, Gold, Silver.
Using the same reasoning as for Combination 1, we see that there are 24 different victory circles that will
contain 2 GOLD medalists and 1 SILVER medalist. However, it is important to realize that these 24 victory
circles must be reduced due to "overcounting." To illustrate this, consider one of the 24 possible Gold-Gold-
Silver victory circles: Albert is awarded a GOLD. Bob is awarded a GOLD. Cami is awarded a SILVER. Notice
that this is the exact same victory circle as the following: Bob is awarded a GOLD. Albert is awarded a GOLD.
Cami is awarded a SILVER. Each victory circle has been "overcounted" because we have been counting each
different ordering of the two gold medals as a unique victory circle, when, in reality, the two different orderings
consist of the exact same victory circle. Thus, the 24 victory circles must be cut in half; there are actually only
12 unique victory circles that will contain 2 GOLD medalists and 1 SILVER medalist. (Note that we did not
have to worry about "overcounting" in Combination 1, because each of those 24 possibilities was unique.)
COMBINATION 3: Gold, Silver, Silver.
Using the same reasoning as for Combination 2, we see that there are 24 possible victory circles, but only 12
unique victory circles that contain 1 GOLD medalist and 2 SILVER medalists.
COMBINATION 4: Gold, Gold, Gold.
Here, once again, there are 24 possible victory circles. However, because all three winners are gold medalists,
there has been a lot of "overcounting!" How much overcounting? Let's consider one of the 24 possible Gold-

Gold-Gold victory circles: Albert is awarded a GOLD. Bob is awarded a GOLD. Cami is awarded a GOLD.
Notice that this victory circle is exactly the same as the following victory circles: Albert-GOLD, Cami-GOLD,
Bob-GOLD. Bob-GOLD, Albert-GOLD, Cami-GOLD. Bob-GOLD, Cami-GOLD, Albert-GOLD. Cami-
GOLD, Albert-GOLD, Bob-GOLD. Cami-GOLD, Bob-GOLD, Albert-GOLD. Each unique victory circle has
actually been counted 6 times! Thus we must divide 24 by 6 to find the number of unique victory circles. There
are actually only unique victory circles that contain 3 GOLD medalists. FINALLY, then, we have
the following:
(Combination 1) 24 unique GOLD-SILVER-BRONZE victory circles. (Combination 2) 12 unique GOLD-
GOLD-SILVER victory circles. (Combination 3) 12 unique GOLD-SILVER-SILVER victory circles.
(Combination 4) 4 unique GOLD-GOLD-GOLD victory circles. Thus, there are unique
victory circles. The correct answer is B.
41.
This question is not as complicated as it may initially seem. The trick is to recognize a recurring pattern
in the assignment of the guards. First, we have five guards (let's call them a, b, c, d, and e) and we
have to break them down into pairs. So how many pairs are possible in a group of five distinct entities?
We could use the combinations formula: nCr. where n is the number of items you are selecting from (the
pool) and k is the number of items you are selecting (the subgroup). Here we would get 5C2 = 10. So
there are 10 different pairs in a group of 5 individuals. However, in this particular case, it is actually
more helpful to write them out (since there are only 5 guards and 10 pairs, it is not so onerous): ab, ac,
ad, ae, bc, bd, be, cd, ce, de. Now, on the first night (Monday), any one of the ten pairs may be assigned,
since no one has worked yet. Let's say that pair ab is assigned to work the first night. That means no pair
containing either a or b may be assigned on Tuesday night. That rules out 7 of the 10 pairs, leaving only
cd, ce, and de available for assignment. If, say, cd were assigned on Tuesday, then on Wednesday no
pair containing either c or d could be assigned. This leaves only 3 pairs available for Wednesday: ab, ae,
and be. At this point the savvy test taker will realize that on any given night after the first, including
Saturday, only 3 pairs will be available for assignment. Those test takers who are really on the ball may
have realized right away that the assignment of any two guards on any night necessarily rules out 7 of
the 10 pairs for the next night, leaving only 3 pairs available on all nights after Monday. The correct
answer is Choice D; 3 different pairs will be available to patrol the grounds on Saturday night.
42. The key to this problem is to avoid listing all the possibilities. Instead, think of an arrangement of five
donuts and two dividers. The placement of the dividers determines which man is allotted which donuts,
as pictured below:
In this example, the first man receives one donut, the second man receives three donuts, and the third
man receives one donut. Remember that it is possible for either one or two of the men to be allotted no
donuts at all. This situation would be modeled with the arrangement below:

Here, the second man receives no donuts. Now all that remains is to calculate the number of ways in
which the donuts and dividers can be arranged: There are 7 objects. The number of ways in which 7
objects can be arranged can be computed by taking 7!: However, the two
dividers are identical, and the five donuts are identical. Therefore, we must divide 7! by 2! and by 5!:
The correct answer choice is A.
43. There are two possibilities in this problem. Either Kim and Deborah will both get chocolate chip cookies
or Kim and Deborah will both get oatmeal cookies. If Kim and Deborah both get chocolate chip cookies,
then there are 3 oatmeal cookies and 2 chocolate chip cookies left for the remaining four children. There
are 5!/3!2! = 10 ways for these 5 remaining cookies to be distributed--four of the cookies will go to the
children, one to the dog. (There are 5! ways to arrange 5 objects but the three oatmeal cookies are
identical so we divide by 3!, and the two chocolate chip cookies are identical so we divide by 2!.) If Kim
and Deborah both get oatmeal cookies, there are 4 chocolate chip cookies and 1 oatmeal cookie left for
the remaining four children. There are 5!/4! = 5 ways for these 5 remaining cookies to be distributed--
four of the cookies will go to the children, one to the dog. (There are 5! ways to arrange 5 objects but the
four chocolate chip cookies are identical so we divide by 4!.) Accounting for both possibilities, there are
10 + 5 = 15 ways for the cookies to be distributed. The correct answer is D.
44. In order to determine how many 10-flavor combinations Sammy can create, we simply need to know
how many different flavors Sammy now has. If Sammy had x flavors to start with and then threw out y
flavors, he now has x – y flavors. Therefore, we can rephrase this questions as: What is x – y ?
According to statement (1), if Sammy had x – y – 2 flavors, he could have made exactly 3,003 different
10-flavor bags. We could use the combination formula below to determine the value of x – y – 2, which
is equal to n in the equation below:
Solving this equation would require some time and more familiarity with factorials than is really
necessary for the GMAT. However, keep in mind that you do not need to solve this equation; you
merely need to be certain that the equation is solvable. (Note, if you begin testing values for n, you will
soon find that n = 15.) Once we know the value of n, we can easily determine the value of x – y, which
is simply 2 more than n. Thus, we know how many different flavors Sammy has, and could determine
how many different 10-flavor combinations he could make. Statement (2) is tells us that x = y + 17.
Subtracting y from both sides of the equation yields the equation x – y = 17. Thus, Sammy has 17
different flavors. This information is sufficient to determine the number of different 10-flavor
combinations he could make. The correct answer is D: Each statement ALONE is sufficient.
45. The three-dice combinations fall into 3 categories of outcomes:
1) All three dice have the same number 2) Two of the dice have the same number with the third having a
different number than the pair 3) All three dice have different numbers By calculating the number of
combinations in each category, we can determine the total number of different possible outcomes by
summing the number of possible outcomes in each category.
First, let’s calculate how many combinations can be made if all 3 dice have the same number. Since
there are only 6 numbers, there are only 6 ways for all three dice to have the same number (i.e., all 1’s,
or all 2’s, etc.). Second, we can determine how many combinations can occur if only 2 of the dice have
the same number. There are 6 different ways that 2 dice can be paired (i.e., two 1’s, or two 2’s or two
3’s, etc.). For each given pair of 2 dice, the third die can be one of the five other numbers. (For example
if two of the dice are 1’s, then the third die must have one of the 5 other numbers: 2, 3, 4, 5, or 6.)
Therefore there are 6 x 5 = 30 combinations of outcomes that involve 2 dice with the same number.
Third, determine how many combinations can occur if all three dice have different numbers. Think of

choosing three of the 6 items (each of the numbers) to fill three "slots." For the first slot, we can choose
from 6 possible items. For the second slot, we can choose from the 5 remaining items. For the third slot,
we can choose from the 4 remaining items. Hence, there are 6 x 5 x 4 = 120 ways to fill the three slots.
However, we do not care about the order of the items, so permutations like {1,2,5}, {5, 2, 1}, {2, 5, 1},
{2, 1, 5}, {5, 1, 2}, and {1, 5, 2} are all considered to be the same result. There are 3! = 6 ways that each
group of three numbers can be ordered, so we must divide 120 by 6 in order to obtain the number of
combinations where order does not matter (every 1 combination has 6 equivalent permutations). Thus
there are combinations where all three dice have different numbers. The total number of
combinations is the sum of those in each category or 6 + 30 + 20 = 56. The correct answer is C.
46. There are two different approaches to solving this problem. The first employs a purely algebraic
approach, as follows: Let us assume there are n teams in a double-elimination tournament. In order to
crown a champion, n – 1 teams must be eliminated, each losing exactly two games. Thus, the minimum
number of games played in order to eliminate all but one of the teams is 2(n – 1). At the time when the
(n – 1)th team is eliminated, the surviving team (the division champion) either has one loss or no losses,
adding at most one more game to the total played. Thus, the maximum number of games that can be
played in an n-team double-elimination tournament is 2(n – 1) + 1. There were four divisions with 9, 10,
11, and 12 teams each. The maximum number of games that could have been played in order to
determine the four division champions was (2(8) + 1) + (2(9) + 1) + (2(10) + 1) + (2(11) + 1) = 17 + 19
+ 21 + 23 = 80. The four division champions then played in a single-elimination tournament. Since each
team that was eliminated lost exactly one game, the elimination of three teams required exactly three
more games. Thus, the maximum number of games that could have been played in order to crown a
league champion was 80 + 3 = 83. The correct answer choice is (B). Another way to approach this
problem is to use one division as a concrete starting point. Let's think first about the 9-team division.
After 9 games, there are 9 losses. Assuming that no team loses twice (thereby maximizing the number of
games played), all 9 teams remain in the tournament. After 8 additional games, only 1 team remains
and is declared the division winner. Therefore, 9 + 8 = 17 games is the maximum # of games than can be
played in this tournament. We can generalize this information and apply it to the other divisions. To
maximize the # of games in the 10-team division, 10 + 9 = 19 games are played. To maximize the # of
games in the 11-team division, 11 + 10 = 21 games are played. To maximize the # of games in the 12-
team division, 12 + 11 = 23 games are played. Thus, the maximum number of games that could have
been played in order to determine the four division champions was 17 + 19 + 21 + 23 = 80. After 3
games in the single elimination tournament, there will be 3 losses, thereby eliminating all but the one
championship team. Thus, the maximum number of games that could have been played in order to
crown a league champion was 80 + 3 = 83. Once again, we see that the correct answer choice is (B).
47. The simplest way to solve this problem is to analyze one row at a time, and one square at a time in each
row if necessary. Let’s begin with the top row. First, let’s place a letter in left box; we have a choice of 3
different letters for this box: X, Y, or Z. Next, we place a letter in the top center box. Now we have only
2 options so as not to match the letter we placed in the left box. Finally, we only have 1 letter to choose
for the right box so as not to match either of the letters in the first two boxes. Thus, we have 3 x 2 x 1 or
6 ways to fill in the top row without duplicating a letter across it. Now let’s analyze the middle row by
assuming that we already have a particular arrangement of the top row, say the one given in the example
above (XYZ).
X Y Z
Given
Arrangement of
Top Row
Middle Row
LEFT Options
Middle Row
CENTER Options
Middle Row
RIGHT Options

Y X Z
Not Allowed: Z
is in Right
column twice
Z X Permissible
Z X Y Permissible
Y X
Not Allowed: Y
is in Center
column twice
Now let’s analyze the bottom row by assuming that we already have a particular arrangement of the top
and middle rows. Again, let’s use top and middle row arrangements given in the example above.
X Y Z
Given Arrangement
of Top Row
Y Z X
Give Arrangment
of Middle Row
Bottom Row
LEFT
OPtions
Bottom Row
CENTER
Options
Bottom Row
RIGHT
Options
Z X Y
Only this option is
permissible.
We can see that given fixed top and middle rows, there is only 1 possible bottom row that will work. (In
other words, the 3rd row is completely determined by the arrangement of the 1st and 2nd rows).
By combining the information about each row, we calculate the solution as follows: 6 possible top rows
× 2 possible middle rows × 1 possible bottom row = 12 possible grids. The correct answer is D.
48. This is a counting problem that is best solved using logic. First, let’s represent the line of women as
follows:
0000
0000
where the heights go from 1 to 8 in increasing order and the unknowns are designated 0s. Since the
women are arranged by their heights in increasing order from left to right and front to back, we know
that at a minimum, the lineup must conform to this:
0008
1000
Let’s further designate the arrangement by labeling the other individuals in the top row as X, Y and Z,
and the individuals in the bottom row as A, B, and C.
XYZ8
1ABC
Note that Z must be greater than at least 5 numbers (X, Y, B, A, and 1) and less than at least 1 number
(8). This means that Z can only be a 6 or a 7. Note that Y must be greater than at least 3 numbers (X, A
and 1) and less than at least 2 numbers (8 and Z). This means that Y can only be 4, 5, or 6. Note that X
must be greater than at least 1 number (1) and less than at least 3 numbers (8, Z and Y), This means that
X must be 2, 3, 4, or 5. This is enough information to start counting the total number of possibilities for
the top row. It will be easiest to use the middle unknown value Y as our starting point. As we
determined above, Y can only be 4, 5, or 6. Let’s check each case, making our conclusions logically: If
Y is 4, Z has 2 options (6 or 7) and X has 2 options (2 or 3). This yields 2 x 2 = 4 possibilities. If Y is 5,
Z has 2 options (6 or 7), and X has 3 options (2, 3, or 4). This yields 2 x 3 = 6 possibilities. If Y is 6, Z

has 1 option (7), and X has 4 options (2, 3, 4, or 5). This yields 1 x 4 = 4 possibilities. For each of the
possibilities above, the bottom row is completely determined because we have 3 numbers left, all of
which must be in placed increasing order. Hence, there are 4 + 6 + 4 = 14 ways for the women to pose.
The correct answer is (B).
49. One way to approach this problem is to pick an actual number to represent the variable n. This helps to
make the problem less abstract. Let's assume that n = 6. Since each of the regional offices must be
represented by exactly one candidate on the committee, the committee must consist of 6 members.
Further, because the committee must have an equal number of male and female employees, it must
include 3 men and 3 women. First, let's form the female group of the committee. There are 3 women to
be selected from 6 female candidates (one per region). One possible team selection can be represented as
follows, where A, B, C, D, E, & F represent the 6 female candidates:
A B C D E F
Yes Yes Yes No No No
In the representation above, women A, B, and C are on the committee, while women D, E, and F are not.
There are many other possible 3 women teams. Using the combination formula, the number of different
combinations of three female committee members is 6! / (3! × 3!) = 720/36 = 20. To ensure that each
region is represented by exactly one candidate, the group of men must be selected from the remaining
three regions that are not represented by female employees. In other words, three of the regions have
been “used up” in our selection of the female candidates. Since we have only 3 male candidates
remaining (one for each of the three remaining regions), there is only one possible combination of 3
male employees for the committee. Thus, we have 20 possible groups of three females and 1 possible
group of three males for a total of 20 × 1 = 20 possible groups of six committee members. Now, we
can plug 6 in for the variable n in each of the five answer choices. The answer choice that yields
the solution 20 is the correct expression. Therefore, B is the correct answer since plugging 6 in for n,
yields the following:
50. This is a relatively simple problem that can be fiendishly difficult unless you have a good approach to
solving it and a solid understanding of how to count. We will present two different strategies here.
Strategy 1: This problem seems difficult, because you need to figure out how many distinct orientations
the cube has relative to its other sides. Given that you can rotate the cube in an unlimited number of
ways, it is very difficult to keep track of what is going on – unless you have a system. Big hint: In order
to analyze how multiple things behave or compare or are arranged relative to each other, the first thing
one should do is pick a reference point and fix it. Here is a simple example. Let’s say you have a round
table with four seat positions and you want to know how many distinct ways you can orient 4 people
around it relative to each other (i.e., any two orientations where all 4 people have the same person to
their left and to their right are considered equivalent). Let’s pick person A as our reference point and
anchor her to the North position. Think about this next statement and convince yourself that it is true: By
choosing A as a fixed reference, all distinct arrangements of the other 3 people relative to A will
constitute the complete set of distinct arrangements of all 4 people relative to each other. Hence, fixing
the location of one person makes it significantly easier to keep track of what is going on. Given A is
fixed at the North, the 3 other people can be arranged in the 3 remaining seats in 3! = 6 ways, so there
are 6 distinct orientations of 4 people sitting around a circular table. Using the same principle, we can
conclude that, in general, if there are N people in a circular arrangement, after fixing one person at a
reference point, we have (N-1)! distinct arrangements relative to each other. Now let’s solve the
problem. Assume the six sides are: Top (or T), Bottom (or B), N, S, E, and W, and the six colors are
designated 1, 2, 3, 4, 5, and 6. Following the first strategy, let’s pick color #1 and fix it on the Top side
of the cube. If #1 is at the Top position, then one of the other 5 colors must be at the Bottom position

and each of those colors would represent a distinct set of arrangements. Hence, since there are exactly 5
possible choices for the color of the Bottom side, the number of unique arrangements relative to #1 in
the Top position is a multiple of 5. For each of the 5 colors paired with #1, we need to arrange the other
4 colors in the N, S, E, and W positions in distinct arrangements. Well, this is exactly like arranging 4
people around a circular table, and we have already determined that there are (n-1)! or 3! ways to do
that. Hence, the number of distinct patterns of painting the cube is simply 5 x 3! = 30. The correct
answer is B.
Strategy 2: There is another way to solve this kind of problem. Given one distinct arrangement or
pattern, you can try to determine how many equivalent ways there are to represent that one particular
arrangement or pattern within the set of total permutations, then divide the total number of permutations
by that number to get the number of distinct arrangements. This is best illustrated by example so let’s go
back to the 4 people arranged around a circular table. Assume A is in the North position, then going
clockwise we get B, then C, then D. Rotate the table 1/4 turn clockwise. Now we have a different
arrangement where D is at the North position, followed clockwise by A, then B, then C. BUT, this is
merely a rotation of the distinct relative position of the 4 people (i.e., everyone still has the same person
to his right and to his left) so they are actually the same arrangement. We can quickly conclude that
there are 4 equivalent or non-distinct arrangements for every distinct relative positioning of the 4 people.
We can arrange 4 people in a total of 4! = 24 ways. However, each DISTINCT arrangement has 4
equivalents, so in order to find the number of distinct arrangements, we need to divide 4! by 4, which
yields 3! or 6 distinct ways to arrange 4 people around a circular table, the same result we got using the
“fixed reference” method in Strategy 1. Generalizing, if there are N! ways to arrange N people around a
table, each distinct relative rotation can be represented in N ways (each 1/Nth rotation around the table)
so the number of distinct arrangements is N!/N = (N-1)! Now let’s use Strategy #2. Consider a cube that
is already painted in a particular way. Imagine putting the cube on the table, with color #1 on the top
side. Note, that by rotating the cube, we have 4 different orientations of this particular cube given color
#1 is on top. Using symmetry, we can repeat this analysis when #1 is facing any of the other 5
directions. Hence, for each of the six directions that the side painted with #1 can face, there are 4 ways
to orient the cube. Consequently, there are 6 x 4 = 24 total orientations of any one cube painted in a
particular manner. Since there are 6 sides and 6 colors, there are 6! or 720 ways to color the six sides
each with one color. However, we have just calculated that each DISTINCT pattern has 24 equivalent
orientations, so 720 must be divided by 24 to get the number of distinct patterns. This yields 720/24 =
30, confirming the answer found using Strategy #1. Again, the correct answer is B.
51. The first thing to recognize here is that this is a permutation with restrictions question. In such questions
it is always easiest to tackle the restricted scenario(s) first. The restricted case here is when all of the
men actually sit together in three adjacent seats. Restrictions can often be dealt with by considering the
limited individuals as one unit. In this case we have four women (w1, w2, w3, and w4) and three men (m1,
m2, and m3). We can consider the men as one unit, since we can think of the 3 adjacent seats as simply 1
seat. If the men are one unit (m), we are really looking at seating 5 individuals (w1, w2, w3, w4, and m) in
5 seats. There are 5! ways of arranging 5 individuals in a row. This means that our group of three men is
sitting in any of the “five” seats. Now, imagine that the one seat that holds the three men magically splits
into three seats. How many different ways can the men arrange themselves in those three seats? 3!. To
calculate the total number of ways that the men and women can be arranged in 7 seats such that the men
ARE sitting together, we must multiply these two values: 5!3!. However this problem asks for the
number of ways the theatre-goers can be seated such that the men are NOT seated three in a
row. Logically, this must be equivalent to the following: (Total number of all seat arrangements) –
(Number of arrangements with 3 men in a row). The total number of all seat arrangements is simply 7!
so the final calculation is 7! – 5!3!. The correct answer is C.

52. It is important to first note that our point of reference in this question is all the possible subcommittees
that include Michael. We are asked to find what percent of these subcommittees also include Anthony.
Let's first find out how many possible subcommittees there are that must include Michael. If Michael
must be on each of the three-person committees that we are considering, we are essentially choosing
people to fill the two remaining spots of the committee. Therefore, the number of possible committees
can be found by considering the number of different two-people groups that can be formed from a pool
of 5 candidates (not 6 since Michael was already chosen). Using the anagram method to solve this
combinations question, we assign 5 letters to the various board members in the first row. In the second
row, two of the board members get assigned a Y to signify that they were chosen and the remaining 3
get an N, to signify that they were not chosen:
A B C D E
Y Y N N N
The number of different combinations of two-person committees from a group of 5 board members
would be the number of possible anagrams that could be formed from the word YYNNN = 5! / (3!2!) =
10. Therefore there are 10 possible committees that include Michael. Out of these 10 possible
committees, of how many will Anthony also be a member? If we assume that Anthony and Michael
must be a member of the three-person committee, there is only one remaining place to fill. Since there
are four other board members, there are four possible three-person committees with both Anthony and
Michael. Of the 10 committees that include Michael, 4/10 or 40% also include Anthony. The correct
answer is C. As an alternate method, imagine splitting the original six-person board into two equal
groups of three. Michael is automatically in one of those groups of three. Now, Anthony could occupy
any one of the other 5 positions -- the 2 on Michael's committee and the 3 on the other committee. Since
Anthony has an equal chance of winding up in any of those positions, his chance of landing on Michael's
committee is 2 out of 5, or 2/5 = 40%. Since that probability must correspond to the ratio of committees
asked for in the problem, the answer is achieved. Answer choice C is correct.
53. The easiest way to solve this question is to consider the restrictions separately. Let’s start by considering
the restriction that one of the parents must drive, temporarily ignoring the restriction that the two sisters
won't sit next to each other. This means that…
2 people (mother or father) could sit in the driver’s seat
4 people (remaining parent or one of the children) could sit in the front passenger seat
3 people 0could sit in the first back seat
2 people could sit in the second back seat
1 person could sit in the remaining back seat
The total number of possible seating arrangements would be the product of these various possibilities: 2 × 4 × 3
× 2 × 1 = 48. We must subtract from these 48 possible seating arrangements the number of seating
arrangements in which the daughters are sitting together. The only way for the daughters to sit next to each
other is if they are both sitting in the back. This means that…
2 people (mother or father) could sit in the driver’s seat
2 people (remaining parent or son) could sit in the front passenger seat

Now for the back three seats we will do something a little different. The back three seats must contain the two
daughters and the remaining person (son or parent). To find out the number of arrangements in which the
daughters are sitting adjacent, let’s consider the two daughters as one unit. The remaining person (son or parent)
is the other unit. Now, instead of three seats to fill, we only have two "seats," or units, to fill.
There are 2 × 1 = 2 ways to seat these two units.
However, the daughter-daughter unit could be d1d2 or d2d1
We must consider both of these possibilities so we multiply the 2 by 2! for a total of 4 seating possibilities in the
back. We could also have manually counted these possibilities: d1d2X, d2d1X, Xd1d2, Xd2d1
Now we must multiply these 4 back seat scenarios by the front seat scenarios we calculated earlier:
(2 × 2) × 4 = 16
front back
If we subtract these 16 "daughters-sitting-adjacent" scenarios from the total number of "parent-driving"
scenarios, we get: 48 – 16 = 32 The correct answer is B.
54.
Ignoring Frankie's requirement for a moment, observe that the six mobsters can be arranged 6! or 6 x 5 x 4 x 3 x
2 x 1 = 720 different ways in the concession stand line. In each of those 720 arrangements, Frankie must be
either ahead of or behind Joey. Logically, since the combinations favor neither Frankie nor Joey, each would be
behind the other in precisely half of the arrangements. Therefore, in order to satisfy Frankie's requirement, the
six mobsters could be arranged in 720/2 = 360 different ways. The correct answer is D.
55.
We can imagine that the admissions committee will choose a “team” of students to receive scholarships.
However, because there are three different levels of scholarships, it will not suffice to simply count the number
of possible “scholarship teams.” In other words, the committee must also place the “scholarship team” members
according to scholarship level. So, order matters. If we knew the number of scholarships to be granted at each of
the three scholarship levels, we could use the anagram method to count the number of ways the scholarships
could be doled out among the 10 applicants. To show that this is true, let’s invent a hypothetical case for which
there are 3 scholarships to be granted at each of the three levels. If we assign letters to the ten applicants from A
to J, and if T represents a $10,000 scholarship, F represents a $5,000 scholarship, O represents a $1,000
scholarship, and N represents no scholarship, then the anagram grid would look like this:
A B C D E F G H I
J
T T T F F F O O O
N
Our “word” is TTTFFFOOON. To calculate the number of different “spellings” of this “word,” we use the
following shortcut:
10!
(3!)(3!)(3!)(1!)
The 10 represents the 10 total applicants, the 3’s represent the 3 T’s, 3 F’s, and 3 O’s, and the 1
represents the 1 N. Simplifying this expression would yield the number of ways to distribute the
scholarships among the 10 applicants. So, knowing the number of scholarships to be granted at each of
the three scholarship levels allows us to calculate the answer to the question. Therefore, the rephrased
question is: "How many scholarships are to be granted at each of the three scholarship levels?" (1)
INSUFFICIENT: While this tells us the total number of scholarships to be granted, we still don’t know
how many from each level will be granted. (2) INSUFFICIENT: While this tells us that the number of
scholarships from each level will be equal, we still don’t know how many from each level will be

granted. (1) AND (2) SUFFICIENT: If there are 6 total scholarships to be granted and the same number
from each level will be granted, there will be two $10,000 scholarships, two $5,000 scholarships, and
two $1,000 scholarships granted. The correct answer is C.
56.
In order to know how many panels we can form when choosing three women and two men, we need to
know how many women and men we have to choose from. In this case, we need to know the value of x
(the number of women to choose from) and the value of y (the number of men to choose from). The
number of panels will be equal to the number of groups of three that could be chosen from x women
multiplied by the number of groups of two that could be chosen from y men. (1) INSUFFICIENT: This
statement tells us that choosing 3 from x + 2 would yield 56 groups. One concept that you need to know
for the exam is that when dealing with combinations and permutations, each result corresponds to a
unique set of circumstances. For example, if you have z people and know that choosing two of them
would result in 15 different possible groups of two, it must be true that z = 6. No other value of z would
yield exactly 15 different groups of two. So if you know how many subgroups of a certain size you can
choose from an unknown original larger group, you can deduce the size of the larger group. In the
present case, we know that choosing three women from x + 2 women would yield 56 groups of 3. These
numbers must correspond to a specific value of x. Do not worry if you do not know what value of x
would yield these results (in this case, x must equal 6, because the only way to obtain 56 groups
if choosing 3 is to choose from a group of 8. Since the statement tells us that 8 is 2 more than the value
of x, x must be 6). The GMAT does not expect you to memorize all possible results. It is enough to
understand the underlying concept: if you know the number of groups yielded (in this case 56), then you
know that there is only one possible value of x. (2) INSUFFICIENT: Knowing only that x = y + 1 tells
us nothing specific about the values of x and y. Infinitely many values of x and y satisfy this equation,
thus yielding infinitely many answers to the question. (1) AND (2) SUFFICIENT: Taking the
statements together, we know that (1) gives us the value of x and that (2) allows us to use that value of x
to determine the value of y. Remember that, with data sufficiency, we do not actually need to calculate
the values for x and y; it is enough to know that we can calculate them. The correct answer is C.
57.
To find the total number of possible committees, we need to determine the number of different five-
person groups that can be formed from a pool of 8 candidates. We will use the anagram method to solve
this combinations question. First, let's create an anagram grid and assign 8 letters in the first row, with
each letter representing one of the candidates. In the second row, 5 of the candidates get assigned a Y to
signify that they were chosen for a committee; the remaining 3 candidates get an N, to signify that they
were not chosen:
A B C D E F G H
Y Y Y Y Y N N N
The total number of possible five-person committees that can be created from a group of 8 candidates will be
equal to the number of possible anagrams that can be formed from the word YYYYYNNN = 8! / (5!3!) = 56.
Therefore, there are a total of 56 possible committees. The correct answer is D.
58. Using the anagram method to solve this combinations question, we assign 10 letters to the 10 teams in
the first row. In the second row, three of the teams are assigned numbers (1,2,3) representing gold, silver
and bronze medals. The remaining seven teams get an N, to signify that they do NOT receive a medal.

A B C D E F G H I J
1 2 3 N N N N N N N
The above anagram represents ONE possible way to assign the medals. The number of different possible ways
to assign the three medals to three of the 10 competing teams is equal to the number of possible anagrams
(arrangements of letters) that can be formed from the word 123NNNNNNN. Since there are 10 letters and 7
repeats, this equals 10! / 7! . Ans A.
59.
This problem cannot be solved through formula. Given that the drawer contains at least three socks of each color, we
know that at least one matched pair of each color can be removed. From the first nine socks, we can therefore make three
pairs, leaving three ‘orphans.’ To think through the problem, it is useful to conceptualize removing those nine socks from
the drawer. We will need additional information about any socks left in the drawer to solve the problem.
(1) INSUFFICIENT: Once those first nine socks have been removed, only two socks remain, but we do not have sufficient
information about the color of the two socks to solve the problem. If the two remaining socks are a matched pair, we can
add this final pair to the first three. This scenario results in four pairs and three orphans. However, if the final two socks
are mismatched, each will make a new pair with one of the original three orphans, resulting in five pairs and one orphan.
(2) INSUFFICIENT: This statement gives no information about how many socks are in the drawer.
(1) AND (2) INSUFFICIENT: Given that the drawer contains 11 socks and that there are an equal number of black and
gray socks, there are two possible scenarios. Three black, three gray, and five blue socks would yield four pairs total.
Four black, four gray, and three blue socks would yield five pairs total.
The correct answer is E.
60.
There are 3 × 2 × 4 = 24 possible different shirt-sweater-hat combinations that Kramer can wear. He wears the first one
on a Wednesday. The following Wednesday he will wear the 8th combination. The next Wednesday after that he will wear
the 15th combination. The next Wednesday after that he will wear the 22nd combination. On Thursday, he will wear the
23rd combination and on Friday he will wear the 24th combination.
Thus, the first day on which it will no longer be possible to wear a new combination is Saturday. The correct answer is E.
61.
With one letter, 26 stocks can be designated.

With two letters, 26*26 stocks can be designated.
With three letters, 26*26*26 stocks can be designated.
So, 26+26
2
+26
3
, the units digit is 8.
Answer is E
62.
C(4,1)C(6,2)+C(4,2)C(6,1)+C(4,3)=60+36+4=100
63.
C(9,1)C(9,1)C(8,1)C(7,1)=4536
64.
Answer: 10
65.
A derangement is a permutation in which none of the objects appear in their "natural" (i.e., ordered) place. For example,
the only derangements of (1, 2, 3) are (2, 3, 1) and (3, 1, 2), so !3 = 2. The function giving the number of distinct
derangements on n elements is called the sub-factorial !n and is equal to
If some, but not necessarily all, of the items are not in their original ordered positions, the configuration can be referred to
as a partial derangement. Among the n! possible permutations of n distinct items, examine the number R(n, k) of these
permutations in which exactly k items are in their original ordered positions. Then
R(n, n) = 1
R (n, n-1) = 0
, where denotes
n
Ck and !(n – k) is the sub-factorial.
In the given question, n = 4, k = 1, R (4, 1) =
4
C1 !(4 – 1) = 4 2 = 8. Total number of arrangements =
4
P4 = 4! = 24.
Answer = 8/24 = 1/3.

66.
When solve such circular permutation questions, we just count one element less than the line permutation question.
The answer is P4,4=24

Gmat quant topic 7 p and c sol

More Related Content

What's hot (20)

Viewers also liked (9)

Similar to Gmat quant topic 7 p and c sol (20)

More from Rushabh Vora (16)

Recently uploaded (20)

Gmat quant topic 7 p and c sol