Combinations Probability: Counting When Order Doesn't Matter
Imagine you are picking a team of 3 students from a class of 10. You do not care who is chosen first, second, or third — you only care which 3 students end up on the team. That is a combination: a selection where order does not matter.
If you now ask for the chance that one particular set of 3 students (say your three best friends) is the one chosen, you are doing combinations probability: probability where the favourable and total outcomes are both counted using combinations.
The Core Intuition
When every possible selection is equally likely (like drawing names from a hat), the probability of an event is the familiar ratio:
P(E)=Total number of possible selectionsNumber of favourable selections
This is the same "favourable over total" idea from basic probability — the only new part is that we count combinations, not arrangements, because order is irrelevant.
The key difference from permutations: the group {Alice, Bob, Charlie} is the same selection as {Charlie, Bob, Alice}. Swapping the order of chosen items does not create a new outcome.
The Precise Statement
Let n be the total number of distinct objects and let r be how many you choose (without replacement). The number of ways to choose r objects from n is:
(rn)=r!(n−r)!n!
read as "n choose r". If a selection of r objects is made at random and every combination is equally likely, then the probability of an event E is:
P(E)=(rn)number of combinations in E
A Worked Example
Problem: A bag has 5 red marbles and 3 blue marbles. You draw 3 marbles at random (without looking). What is the probability of getting exactly 2 red marbles?
Step 1 — Total outcomes. Choosing 3 marbles from 8:
(38)=3!5!8!=56
Step 2 — Favourable outcomes. You need exactly 2 red (from 5) and 1 blue (from 3):
(25)×(13)=10×3=30
Step 3 — Probability.
P(exactly 2 red)=5630=2815
For "exactly k of one type", multiply (ways to choose k from that type) by (ways to choose the rest from the others), then divide by the total number of combinations.
Combinations vs. Permutations
| Situation | Use |
|---|
| Order does not matter (team, hand of cards, lottery numbers) | Combinations |
| Order does matter (password, race positions, seating) | Permutations |
If unsure, ask: "Would swapping two selected items change the outcome?" If no, it is combinations.
Do not use plain combinations when items are chosen with replacement (like drawing a card and putting it back). Combinations assume selection without repetition; with replacement the counting changes.
The Big Picture
Combinations probability is just careful counting when order is irrelevant:
- Count the total equally likely selections using (rn).
- Count how many of those match your event.
- Divide.
Combinations Probability links the NCERT Class 11 Mathematics chapters on Permutations & Combinations and Probability, matching searches like "probability using combinations formula class 11" or "probability important questions class 11 maths". This (rn)-based approach to counting favourable outcomes is a staple technique in CBSE board and JEE Main problems.