ghostie
I have learned factorial and I can answer simple questions like how many 3-man group from 7 people.
But I become confused when it gets harder.
I must have missed the underlying fundamental concept I hope someone can shed some light.
Let's begin with very downright basic example, like:
Fill in 3 empty fields each with one of the following alphabets. How many unique combination? Order DOES matter?
Note: I don't just want the answer, I care more about how we go about tackling such question!1) ABCDE
2) AABBCDE
3) AAABCCDDEEE
Dear
ghostieI'm happy to help.

First of all, here are some blogs that might help. This one explains the
Fundamental Counting Principle, a pivotal idea.
https://magoosh.com/gmat/2012/gmat-quant-how-to-count/This one talks more about difficult counting problems.
https://magoosh.com/gmat/2013/difficult- ... -problems/Even more so than in other areas of math, memorization is an approach that will really hamper you in counting problems. If your primary problem-solving strategy is just asking which formula to use, then you are more or less shutting yourself out of the 700 level problems. Counting problems are all about how we frame the problem, the perspective we use to interpret it. Developing this perspective is everything, and apart from that, the formulas are not very useful beyond the simple problems.
Your question doesn't quite make sense --- "
Fill in 3 empty fields each with one of the following alphabets." I assume you mean
1) How many unique 5-letter combinations can we make with ABCDE?
2) How many unique 7-letter combinations can we make with AABBCDE?
3) How many unique 11-letter combinations can we make with AAABCCDDEEE? Those are the questions I will answer.
The first, of course, is a straightforward permutation question. There are 5! = 120 unique combination.
For the other two, we will figure out the total number of permutations, and then go back and divide off repetition.
In #2, we have seven elements, so start out just by finding all permutation --- 7!. Now, if we interchange the two A's, we get the same combination, so divide by 2. Similarly, with the two B's, so divide by 2 again. There are 7!/(2*2) = 1260 unique combinations.
In #3, we have eleven elements. All permutations = 11! Now, to eliminate repetitions, we divide out for
all orders of 3 A's --- divide by 3! = 6
all orders of 2 C's --- divide by 2
all orders of 2 D's --- divide by 2
all orders of 3 E's --- divide by 3! = 6
That's 11!/(6*2*2*6) = 11!/144 = 277,200 unique combinations.
I got this last number with a calculator. It is unlikely the GMAT would expect you do the calculation in #2 --- they might leave the answer in the form 7!/4 ---- and they definitely would not expect you to come up with the answer to #3 without a calculator --- if they asked that question, it would be in the form 11!/144.
Again, don't get stuck on formulas. Perspective is everything.
Does all this make sense?
Mike