Combinations Formula (nCr)
Master the art of selection. Learn how to calculate combinations (nCr) when the order of items doesn't matter.
C(n, r) = \binom{n}{r} = \frac{n!}{r!(n-r)!}Custom Math Quiz & Test Maker
Need a mixed Friday review or unit assessment? Create a custom test combining multiple math skills in 15 seconds.
- ✓Anti-cheat Set A & Set B with alternate numbers for adjacent desks
- ✓100% step-by-step teacher grading keys with intermediate lines
- ✓1-click Google Classroom links for student tablet/Chromebook testing
🎓 100% Free for Teachers & Parents • No Signups Required • Pure Printable PDF
🎯 Key Concepts
What you need to know about Combinations:
Order Doesn't MatterUnlike permutations, in combinations, the order of selection has no effect. {A, B} is same as {B, A}.
Choosing SubsetsUsed when you need to select a group or subset from a larger set without arranging them.
Factorial NotationUses n! (n factorial), which is the product of all positive integers up to n.
📝 Worked Examples
Example 1: Choosing a Fruit Bowl
How many ways to choose 2 fruits from 4 (Apples, Bananas, Cherries, Dates)?n = 4, r = 2C(4, 2) = 4! / (2! × (4-2)!)C(4, 2) = (4 × 3 × 2 × 1) / ((2 × 1) × (2 × 1))C(4, 2) = 24 / 4 = 6Example 2: Selecting a Committee
A class of 10 students needs 3 representatives. How many combinations are possible?n = 10, r = 3C(10, 3) = 10! / (3! × 7!)C(10, 3) = (10 × 9 × 8) / (3 × 2 × 1)C(10, 3) = 720 / 6 = 120💡 Pro Tips
Symmetry Rule
C(n, r) is always equal to C(n, n-r). Choosing 2 people to leave is the same as choosing 8 people to stay.
Zero Case
C(n, 0) is always 1. There is only one way to choose nothing.
Choosing All
C(n, n) is always 1. There is only one way to choose everyone.