punzo Wrote:Permutation and combination is my weakest topic. I am really not sure how to distinguish between perm. and comb.
The good news is that Permutations and Combinations doesn't show up all that much on the GMAT. You might get one or two on the whole exam. So this one question type won't be what makes or breaks your score. So I wouldn't worry about this too much; focus your attention to other areas of weakness.
A quick answer to your question about Permutations and Combinations. Permutations is used when order matters. Combinations is used when order does not matter.
In this case, if we want to form a subcommittee with members A, B, and C, it doesn't really matter if I select A, B, then C; or A, C, then B; or B, C, then A; or C, B, then A. All three options give me the same subcommittee. This is a combinations problem.
However, if in this committee, we select a President, a VP, and a Secretary, the order does matter. Because A, B, then C is different from B, C, then A (in order of Pres, VP, and Sec). This would be a permutations problem.
If you follow MGMAT's Strategy Guides, we recommend the Anagram Grid. The beauty of this approach is that we don't need to know either permutations or combinations to do the problem; it automatically works itself out.
Let's suppose the six member board is Anthony (A), Michael (M) and the other four (B, C, D, and E). When we solve this problem, we are looking for the percent of all possibilities. So basically we need to calculate
[(Number of subcommittees that include A &M) / (Number of subcommittees that include M)] * 100%
We want to first find the number of subcommittees that have A and M in it. Well, if we already know A and M are in it, then there are only four others (B, C, D, or E) that can join them for the third spot in that subcommittees. There are only 4 subcommittes with both A and M.
Now if we want to find the number of subcommittees that include M, we have two spots remaining that can be filled with five Board members (A, B, C, D, or E). Using the Anagram approach, we can label "Y" if they are selected on the subcommittee, or "N" if they are not.
A, B, C, D, E
Y, Y, N, N, N
So the question is how many anagrams we can form from YYNNN? This will be 5!/(2!3!) = 10.
So the percent of subcommittees with M that also include A is (4 / 10)*100% = 40%.
The combinations approach would be:
(4C1)/(5C2) = [(4!)/(3!1!)]/[(5!)/(3!2!)] = 4 / 10 = 40%