Combinations: Choosing Without Ordering
Imagine you're picking a team of 3 players from a group of 5 friends: Alice, Bob, Charlie, Deepa, and Esha. The team {Alice, Bob, Charlie} is the same team as {Bob, Charlie, Alice} — the order you name them doesn't matter. What matters is which 3 people you pick.
That's the core idea of combinations: selection without regard to order.
The Intuition: Why Order Doesn't Matter
Let's contrast with permutations. If you were assigning positions — captain, vice-captain, treasurer — then {Alice as captain, Bob as vice-captain, Charlie as treasurer} is different from {Bob as captain, Alice as vice-captain, Charlie as treasurer}. Order matters there.
But for a plain team, a committee, a hand of cards, or a set of toppings on a pizza — order is irrelevant. You just care about which items are chosen.
Key distinction: Permutations count arrangements (order matters). Combinations count selections (order doesn't matter).
From Permutations to Combinations
Suppose you want to choose 2 letters from {A, B, C}. If order mattered, you'd have these 6 permutations:
AB, BA, AC, CA, BC, CB
But if order doesn't matter, AB and BA are the same selection. So the distinct combinations are just:
{A, B}, {A, C}, {B, C} — only 3.
Notice the pattern: each combination of 2 items corresponds to 2!=2 permutations (because you can arrange those 2 items in 2 ways). So:
Number of combinations=r!Number of permutations
Where r is the number of items you're choosing.
The Precise Statement
(rn)=r!(n−r)!n!
This is read as "n choose r" and gives the number of ways to select r distinct objects from a set of n distinct objects, where order does not matter.
Conditions:
- n and r are non-negative integers
- r≤n
- The objects are distinct (no repetitions)
Why the Formula Works
Start with permutations of r items from n: P(n,r)=(n−r)!n!.
Each combination of r items can be arranged in r! different orders. So the number of combinations is the number of permutations divided by the number of ways to rearrange each selection:
(rn)=r!P(n,r)=r!(n−r)!n!
A quick check: (0n)=1 (there's exactly one way to choose nothing), and (nn)=1 (one way to choose everything).
A Concrete Example
How many different 5-card hands can be dealt from a standard 52-card deck?
Here, n=52, r=5. The hand {A♠, K♥, Q♦, J♣, 10♠} is the same regardless of the order you receive the cards.
(552)=5!⋅47!52!=5×4×3×2×152×51×50×49×48=2,598,960
That's over 2.5 million possible hands — which is why poker is interesting.
A common mistake: using permutations when order doesn't matter. If you're forming a committee, use combinations. If you're assigning specific roles (president, secretary), use permutations.
When to Use Combinations
Use combinations when:
- You are selecting a subset (team, committee, sample)
- The order of selection is irrelevant
- No repetition of items is allowed (each item can be chosen at most once)
Real exam contexts:
- Choosing questions from a question bank
- Selecting students for a team
- Picking lottery numbers (order of draw doesn't matter)
- Forming a hand of cards
The formula (rn) is one of the most powerful counting tools — it's the foundation for probability, binomial theorem, and much more. Master the intuition first: combinations count groups, not arrangements.
Combinations Selection is one of the core ideas of the NCERT Class 11 Mathematics chapter on Permutations and Combinations, and it underlies many "Combinations: Definition, Formula & Real-World Examples" searches from board and JEE Main aspirants. Because it distinguishes selection from arrangement, it is also a frequent source of important questions in CBSE Class 11/12 exams and competitive entrance tests.