Combination: A selection of objects where order does not matter. The number of ways to select r objects from n distinct objects is C(n,r) = n!/[r!(n-r)!].
- Identify that order doesn't matter (committee members are equivalent)
- Determine n (total objects) and r (objects to select)
- Apply the combination formula: C(n,r) = n!/[r!(n-r)!]
We're selecting 3 people from 8, but order doesn't matter (a committee with Alice, Bob, Charlie is the same as Charlie, Bob, Alice).
C(n,r) = n!/[r!(n-r)!] = 8!/[3!(8-3)!] = 8!/(3!×5!)
C(8,3) = (8×7×6×5!)/(3!×5!) = (8×7×6)/(3×2×1) = 336/6 = 56
There are 56 different committees possible.
• Order doesn't matter: Committees are equivalent regardless of member order
• Combination formula: C(n,r) = n!/[r!(n-r)!]
• Factorial simplification: Cancel common terms in numerator and denominator
Team Selection: When forming a team where all members have equal status, order doesn't matter, so use combinations.
A basketball team is the same regardless of which player is listed first, second, etc.
C(12,5) = 12!/(5!×7!) = (12×11×10×9×8×7!)/(5!×7!)
C(12,5) = (12×11×10×9×8)/(5×4×3×2×1) = 95,040/120 = 792
There are 792 different basketball teams possible.
• Equal status: All team members have the same role/status
• Selection without arrangement: Just choosing who's on the team
• Factorial cancellation: Cancel (n-r)! terms from numerator and denominator
Handshake Problem: Each handshake involves a pair of people. Since a handshake between A and B is the same as between B and A, this is a combination problem.
Each handshake is a unique pair of people. Since shaking hands with someone is mutual, order doesn't matter.
We need to select 2 people from 10 to form a handshake: C(10,2) = 10!/(2!×8!)
C(10,2) = (10×9×8!)/(2!×8!) = (10×9)/2 = 90/2 = 45 handshakes
There are 45 handshakes that occur.
• Mutual relationship: A handshake between A and B is the same as B and A
• Pair selection: Selecting 2 from n objects always uses C(n,2)
• Reciprocal relationship: The connection goes both ways equally
Combination: A selection of objects where the order does not matter. Different orders of the same objects represent the same combination.
Binomial Coefficient: Another name for C(n,r), often written as (n r) and read as "n choose r".
Selection: Choosing objects without regard to the order in which they are selected.
Subset: A combination of r objects from n objects forms an r-element subset.
- Problem identification: Determine if order matters (combination if not)
- Count objects: Identify n (total objects) and r (objects to select)
- Verify independence: Selections don't affect each other's probability
- Apply formula: Use C(n,r) = n!/[r!(n-r)!]
- Calculate: Simplify factorials carefully
- Verify: Check if the answer is reasonable
• Basic combination: \(C(n,r) = \frac{n!}{r!(n-r)!}\)
• Symmetry: \(C(n,r) = C(n,n-r)\)
• Special cases: \(C(n,0) = C(n,n) = 1\), \(C(n,1) = n\), \(C(n,2) = \frac{n(n-1)}{2}\)
• Pascal's triangle: \(C(n,r) = C(n-1,r) + C(n-1,r-1)\)
Card Hand: A collection of cards where the order of dealing doesn't matter. A hand of Ace-King-Queen-Jack-10 is the same as 10-Jack-Queen-King-Ace.
A poker hand is a selection of 5 cards from 52, where the order of cards doesn't matter.
C(52,5) = 52!/(5!×47!) = (52×51×50×49×48×47!)/(5!×47!)
C(52,5) = (52×51×50×49×48)/(5×4×3×2×1) = 311,875,200/120 = 2,598,960
There are 2,598,960 different 5-card poker hands possible.
• Card game hands: Order of cards doesn't change hand value
• Large factorial simplification: Cancel (n-r)! terms efficiently
• Standard deck: 52 unique cards for selection
Constrained Selection: When a problem has specific requirements (like exact numbers from different groups), break it into separate combination problems and multiply the results.
We need exactly 2 men AND exactly 2 women. We'll calculate each separately.
Select 2 men from 6: C(6,2) = 6!/(2!×4!) = (6×5)/2 = 15
Select 2 women from 5: C(5,2) = 5!/(2!×3!) = (5×4)/2 = 10
Total committees = 15 × 10 = 150
There are 150 different committees with exactly 2 men and 2 women.
• Independent selections: Men and women selections are independent
• Multiple constraints: Calculate each constraint separately
• FCP application: Multiply independent combination results
Combination: A selection of objects where the order does not matter. Different orders of the same objects represent the same combination.
Binomial Coefficient: Another name for C(n,r), often written as (n r) and read as "n choose r".
Selection: Choosing objects without regard to the order in which they are selected.
Subset: A combination of r objects from n objects forms an r-element subset.
Equivalent arrangements: When different orderings represent the same outcome.
- Problem identification: Determine if order matters (use combinations if it doesn't)
- Object counting: Identify total objects (n) and objects to select (r)
- Constraint analysis: Check for specific requirements or groupings
- Formula selection: Use appropriate combination formula
- Calculation: Simplify factorials carefully, cancel common terms
- Verification: Check if the answer is reasonable and meets problem requirements
• Basic combination: \(C(n,r) = \frac{n!}{r!(n-r)!}\)
• Symmetry property: \(C(n,r) = C(n,n-r)\)
• Special cases: \(C(n,0) = C(n,n) = 1\), \(C(n,1) = n\), \(C(n,2) = \frac{n(n-1)}{2}\)
• Pascal's identity: \(C(n,r) = C(n-1,r) + C(n-1,r-1)\)
• Sum of row: \(\sum_{r=0}^{n} C(n,r) = 2^n\)
• Simple: Select 2 from 4 = C(4,2) = 6 ways
• Intermediate: Select 3 from 10 = C(10,3) = 120 ways
• Advanced: Committee with constraints = Product of multiple combinations
• Complex: Multiple constraints across different groups = Multi-step combination problems
• "Combination" means "Collection matters, not order" - both start with C
• Use combinations when rearranging selected items gives the same outcome
• Always check if order matters - if not, use combinations
• For constrained problems, break into separate combination problems
• Use symmetry property C(n,r) = C(n,n-r) to simplify calculations
Questions & Answers
Question: I'm confused about when to use combinations versus permutations. How do I decide which one to use?
Answer: The key difference is whether ORDER matters:
- Combinations: Order doesn't matter. Example: Selecting a committee (A,B,C is the same as C,B,A).
- Permutations: Order matters. Example: Arranging people in a line (A,B,C is different from C,B,A).
Ask yourself: "Does changing the order create a different outcome?" If no, use combinations. If yes, use permutations.
More examples: Pizza toppings (combination), seating arrangements (permutation), lottery numbers (combination), race finishers (permutation).
Question: Why do we divide by r! in the combination formula? What does that represent?
Answer: The division by r! accounts for the fact that order doesn't matter in combinations:
- Permutations count every possible arrangement of r objects: P(n,r) = n!/(n-r)!
- But in combinations, each group of r objects is counted r! times (once for each arrangement)
- So we divide by r! to get the actual number of unique groups: C(n,r) = P(n,r)/r!
Example: Selecting 2 from {A,B,C}: Permutations give AB, BA, AC, CA, BC, CB (6 total), but combinations give {A,B}, {A,C}, {B,C} (3 total). We divided by 2! = 2 to account for the duplicate arrangements of each pair.
Question: What's the difference between C(n,r) and P(n,r)? When do I use each?
Answer: Both formulas count selections but handle order differently:
- C(n,r): Number of ways to select r objects from n where ORDER doesn't matter
- P(n,r): Number of ways to select and arrange r objects from n where ORDER matters
Relationship: P(n,r) = C(n,r) × r! (permutations = combinations × arrangements of selected items)
Examples: Choosing 3 committee members from 10 (C(10,3)), vs. choosing 3 people for president, VP, secretary (P(10,3)).