By Fatskills Exam Guides Team — the exam nerds behind 28,500+ quizzes and 2.1M practice questions across 500+ global exams.
"Imagine you’re picking a 5-player basketball team from 12 friends—how many different teams can you make? Combinations unlock the answer in seconds, and they’re on every major exam. Let’s master them now."
Before diving into combinations, ensure you understand: 1. Factorials – The product of all positive integers up to a number (e.g., 4! = 4 × 3 × 2 × 1 = 24). 2. Basic Counting Principle – If one event has m outcomes and another has n outcomes, the total outcomes are m × n. 3. Difference Between Permutations and Combinations – Order matters in permutations (e.g., passwords), but not in combinations (e.g., teams).
Formula: [ nCr = \frac{n!}{r!(n - r)!} ] Variables: - n = Total number of items. - r = Number of items being chosen. - ! = Factorial (e.g., 5! = 5 × 4 × 3 × 2 × 1).
MEMORISE THIS – It’s not always given on exams.
Formula: [ nCr = nC(n - r) ] Why it helps: - If r is large (e.g., 10C8), calculate 10C2 instead (fewer steps). - MEMORISE THIS – Saves time on exams.
Follow these steps for every combination problem:
r = Number of items being picked.
Check if order matters.
If order does matter → Use permutations (nPr).
Write the formula. [ nCr = \frac{n!}{r!(n - r)!} ]
Plug in n and r.
Example: 7C3 = 7! / (3! × 4!).
Simplify factorials.
Example: 7! / (3! × 4!) = (7 × 6 × 5 × 4!) / (3! × 4!) = (7 × 6 × 5) / 3!.
Calculate the remaining multiplication/division.
3! = 6 → (7 × 6 × 5) / 6 = 35.
Verify with symmetry (optional).
Problem: How many ways can you choose 4 students from a class of 10?
n = 10 (total students), r = 4 (students chosen).
Check order.
Order doesn’t matter (Team A,B,C,D is the same as D,C,B,A).
Write the formula. [ 10C4 = \frac{10!}{4!(10 - 4)!} = \frac{10!}{4! \times 6!} ]
Cancel 6! from numerator and denominator: [ \frac{10 × 9 × 8 × 7 × \cancel{6!}}{4! × \cancel{6!}} = \frac{10 × 9 × 8 × 7}{4!} ]
Calculate remaining terms.
4! = 24 → (10 × 9 × 8 × 7) / 24 = 5040 / 24 = 210.
Verify with symmetry.
Answer: 210 ways.
Problem: A pizza shop offers 6 toppings. How many 2-topping pizzas can you make?
What we did and why: - Used combinations because order doesn’t matter. - Simplified factorials to avoid large multiplications.
Problem: A club has 9 members. How many ways can you form a 3-person committee if one member must be the president?
What we did and why: - Recognized the fixed member reduces the problem to a smaller combination. - Avoided the mistake of using 9C3 (which would count all possible committees, not just those with the president).
Problem: A bag contains 5 red marbles and 4 blue marbles. How many ways can you pick 3 marbles with exactly 2 red and 1 blue?
What we did and why: - Split the problem into independent choices (red and blue marbles). - Used the Counting Principle to combine results.
"Alright, let’s lock this in. Combinations are for when order doesn’t matter—like teams, committees, or pizza toppings. The formula is nCr = n! / (r! × (n - r)!). Always: 1. Identify n (total) and r (chosen). 2. Check if order matters—if it does, you’re in permutation land. 3. Simplify factorials before multiplying. 4. Use symmetry (nCr = nC(n - r)) to save time. 5. For word problems, break them into cases (e.g., ‘exactly 2 red’ = 5C2 × 4C1).
Tonight, practice 3 problems: one basic, one with a fixed choice, and one with ‘exactly’ or ‘at least.’ You’ve got this—go ace that exam!
Join 4M+ learners. Unlock unlimited quizzes, wrong-answer tracking, flashcards + reminders, study guides, and 1-on-1 challenges.