Combination and Selection Problems
Quantitative Aptitude › Permutation, Combination and Probability · Topic 22.4
A combination is a selection of objects in which the order does not matter. The number of ways to choose r objects from n distinct objects is nCr = n!/(r!(n - r)!), and it satisfies nCr = nC(n - r).
5 min read · Quantitative Aptitude · Permutation, Combination and Probability
Quick Answer
A combination is a selection of objects in which the order does not matter. The number of ways to choose r objects from n distinct objects is nCr = n!/(r!(n – r)!), and it satisfies nCr = nC(n – r).
At a Glance
- Combination nCr = n!/(r!(n – r)!)
- Symmetry nCr = nC(n – r)
- Relation nPr = nCr × r!
- Handshakes among n nC2
- Triangles from n points nC3 (no three collinear)
Where Does It Fit?
This topic follows Permutation of Distinct Objects and Objects with Repetition but ignores order. It uses the counting principle of Fundamental Principle of Counting (Addition and Multiplication Rules) for combined selections and supplies the counts used in Probability Problems on Balls Drawn from Bags Without Replacement and Probability Problems on Cards, Dice and Coins.
What Is nCr and How Does It Differ from nPr?
In short: nCr counts groups, while nPr counts arrangements. Each group of r objects can be arranged in r! ways, so nPr = nCr × r!.
Combination formulas
- nCr = n!/(r!(n – r)!)
- nCr = nC(n – r), so 12C10 = 12C2.
- nC0 = nCn = 1 and nC1 = n.
- nCr + nC(r – 1) = (n + 1)Cr.
| Value | Working | Answer |
|---|---|---|
| 10C3 | 10 × 9 × 8/(3 × 2 × 1) | 120 |
| 8C2 | 8 × 7/2 | 28 |
| 12C10 | 12C2 = 12 × 11/2 | 66 |
| 9C3 | 9 × 8 × 7/6 | 84 |
| 15C2 | 15 × 14/2 | 105 |
- Pascal rule: nCr + nC(r – 1) = (n + 1)Cr. For example, 8C3 + 8C2 = 56 + 28 = 84 = 9C3.
- Selecting any number of objects: from n distinct objects, each object is either chosen or not, so the number of selections of at least one object is 2 to the power n minus 1. For 4 objects this is 15.
- Dividing into two labelled groups: choosing which r of n objects go into the first group fixes the second group, so the count is nCr.
How Are Selection Problems Solved?
In short: choose the people or objects of each type separately, multiply the counts, and use total minus unwanted for at least conditions.
- Mixed selection: choosing 2 boys from 5 and 2 girls from 4 gives 5C2 × 4C2 = 10 × 6 = 60.
- At least one: choosing 3 from 5 men and 3 women with at least one woman: total 8C3 = 56 minus all men 5C3 = 10, which gives 46.
- Particular objects always included: to choose 4 from 6 with two specific objects always included, choose the other 2 from the remaining 4: 4C2 = 6.
- Handshakes and matches: among 10 people each pair shakes hands once, so there are 10C2 = 45 handshakes.
- Geometry: 8 points, no three collinear, make 8C3 = 56 triangles.
Sums of such counts connect to the probabilities in Probability – Classical Definition and Basic Addition/Multiplication Rules.
Solved Examples
Example 1
Question: Find the value of 10C3.
- 10C3 = (10 × 9 × 8)/(3 × 2 × 1).
- = 720/6.
Answer: 120.
Example 2
Question: From 5 boys and 4 girls, in how many ways can a team of 2 boys and 2 girls be chosen?
- Boys: 5C2 = 10.
- Girls: 4C2 = 6.
- Total = 10 × 6.
Answer: 60.
Example 3
Question: A committee of 3 is chosen from 5 men and 3 women. How many committees have at least one woman?
- Total committees = 8C3 = 56.
- Committees with no woman = 5C3 = 10.
- At least one woman = 56 – 10.
Answer: 46.
Example 4
Question: In a meeting of 10 people each person shakes hands once with each other person. How many handshakes take place?
- Each handshake is a pair of people.
- 10C2 = 10 × 9/2.
Answer: 45.
Example 5
Question: How many triangles can be formed by joining 8 points, no three of which are collinear?
- A triangle needs 3 points.
- 8C3 = 8 × 7 × 6/6.
Answer: 56.
Shortcuts and Tricks
- Use nCr = nC(n – r) to reduce large r.
- For at least conditions, subtract the bad cases from the total.
- When two objects must be included, remove them and reduce both n and r by 2.
- Handshake and match problems are nC2.
- Cancel factors before multiplying.
Common Mistakes
- Using nPr when order does not matter.
- Adding instead of multiplying the counts of independent selections.
- Forgetting to subtract all-wrong cases in at-least problems.
- Counting a pair twice, such as handshakes counted as 10 × 9.
- Using n instead of n – 2 when two objects are fixed.
Practice Questions
- Find 8C2.
- Find 12C10.
- In how many ways can a committee of 3 be chosen from 9 people?
- How many handshakes occur among 15 people?
- From 6 boys and 5 girls, in how many ways can 2 boys and 3 girls be chosen?
Answers: 1) 28; 2) 66; 3) 84; 4) 105; 5) 150.
Why Is This Topic Important?
- Foundation Combinations count groups and choices.
- Exam use Committee and selection questions are common.
- Speed Complement counting saves time in at-least problems.
- Link to probability Probability often uses ratios of combinations.
What Comes Next?
The next topic is Circular Permutation. It returns to arrangements and counts the ways to seat people around a circle.
Key Terms and Formulas
- Combination A selection without regard to order
- nCr n!/(r!(n – r)!)
- Committee A group chosen from a larger group
- Complement counting Total minus unwanted cases
- Pair A selection of two objects
- Symmetry of nCr nCr = nC(n – r)
Related Topics
- Permutation of Identical/Indistinguishable Objects
- Circular Permutation
- Fundamental Principle of Counting (Addition and Multiplication Rules)
- Permutation of Distinct Objects and Objects with Repetition
Exam Corner
Points to Remember
- Order does not matter in combinations.
- nCr = nC(n – r).
- nPr = nCr × r!.
- At least one: total minus none.
- Handshakes: nC2.
Do Not Confuse With
- nCr vs nPr Combination ignores order, and permutation counts it.
- At least vs exactly At least includes all larger cases.
- Pairs vs ordered pairs A handshake is an unordered pair.
- Fixed vs free Fixed objects reduce n and r.
Memory Hook
Groups without order: n choose r.
GS Relevance
Frequently Asked Questions
What is a combination?
A combination is a selection of objects in which the order does not matter. The number of ways to choose r objects from n distinct objects is n factorial divided by (r factorial times (n minus r) factorial), written nCr, so 10C3 equals 120.
What is the difference between permutation and combination?
A permutation counts arrangements in which order matters, while a combination counts selections in which order does not matter. The two are related by nPr equals nCr times r factorial, because each group of r objects can be arranged in r factorial ways.
How do you solve at least one problems in combinations?
To solve an at least one problem in combinations, find the total number of selections and subtract the number of selections that have none of the required kind. For a committee of 3 from 5 men and 3 women, 8C3 minus 5C3 gives 46 committees with at least one woman.
How many handshakes occur among n people?
Among n people where each pair shakes hands once, the number of handshakes is nC2, which equals n times (n minus 1) divided by 2. For 10 people there are 45 handshakes, and for 15 people there are 105.
What is the symmetry property of nCr?
The symmetry property of nCr says that choosing r objects to include is the same as choosing n minus r objects to leave out, so nCr equals nC(n minus r). This makes 12C10 equal to 12C2, which is 66, and it simplifies large calculations.
PYQ Practice — Statement Analysis
1 The value of 10C3 is 120.
10 × 9 × 8 divided by 6 is 120.
2 nCr is equal to nC(n - r).
Choosing r objects is the same as leaving out n - r objects.
3 Among 10 people the number of handshakes is 90.
It is 10C2 = 45.
4 A committee of 3 from 5 men and 3 women with at least one woman can be chosen in 46 ways.
56 minus 10 is 46.
Related Topics
Browse the full Quantitative Aptitude index