Solved Exercises on Combinations (Order Doesn't Matter)

Master combinations: binomial coefficients, selection problems, and applications through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Basic Combination
Exercise 1
A committee of 3 people is to be selected from a group of 8 people. How many different committees are possible?
Definition:

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)!].

Combination method:
  1. Identify that order doesn't matter (committee members are equivalent)
  2. Determine n (total objects) and r (objects to select)
  3. Apply the combination formula: C(n,r) = n!/[r!(n-r)!]
Total people
n=8
Committee size
r=3
Formula
C(8,3)
Result
56
Step 1: Identify the problem type

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).

Step 2: Apply the combination formula

C(n,r) = n!/[r!(n-r)!] = 8!/[3!(8-3)!] = 8!/(3!×5!)

Step 3: Simplify the calculation

C(8,3) = (8×7×6×5!)/(3!×5!) = (8×7×6)/(3×2×1) = 336/6 = 56

56 different committees possible
Final answer:

There are 56 different committees possible.

Applied rules:

• 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

2 Team Selection
Exercise 2
From 12 players, how many different basketball teams of 5 players can be formed?
Definition:

Team Selection: When forming a team where all members have equal status, order doesn't matter, so use combinations.

Total players
n=12
Team size
r=5
Formula
C(12,5)
Calculation
12!/(5!×7!)
Result
792
Step 1: Confirm order doesn't matter

A basketball team is the same regardless of which player is listed first, second, etc.

Step 2: Apply the combination formula

C(12,5) = 12!/(5!×7!) = (12×11×10×9×8×7!)/(5!×7!)

Step 3: Simplify and calculate

C(12,5) = (12×11×10×9×8)/(5×4×3×2×1) = 95,040/120 = 792

792 different teams possible
Final answer:

There are 792 different basketball teams possible.

Applied rules:

• 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

3 Handshake Problem
Exercise 3
In a room of 10 people, if everyone shakes hands with everyone else exactly once, how many handshakes occur?
Definition:

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.

Total people
n=10
Handshake size
r=2
Formula
C(10,2)
Calculation
10!/(2!×8!)
Result
45
Step 1: Model the problem

Each handshake is a unique pair of people. Since shaking hands with someone is mutual, order doesn't matter.

Step 2: Apply the combination formula

We need to select 2 people from 10 to form a handshake: C(10,2) = 10!/(2!×8!)

Step 3: Simplify and calculate

C(10,2) = (10×9×8!)/(2!×8!) = (10×9)/2 = 90/2 = 45 handshakes

45 handshakes occur
Final answer:

There are 45 handshakes that occur.

Applied rules:

• 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

Rules and methods, laws,...
\(C(n,r) = \binom{n}{r} = \frac{n!}{r!(n-r)!}\)
Combination Formula
Basic Combination
\(C(n,r) = \frac{n!}{r!(n-r)!}\)
Selecting r from n objects
Symmetry Property
\(C(n,r) = C(n, n-r)\)
Choosing r is same as leaving out n-r
Special Cases
\(C(n,0) = C(n,n) = 1\)
Selecting none or all
Pascal's Identity
\(C(n,r) = C(n-1,r) + C(n-1,r-1)\)
Recursive relationship
Key definitions:

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.

Complete methodology:
  1. Problem identification: Determine if order matters (combination if not)
  2. Count objects: Identify n (total objects) and r (objects to select)
  3. Verify independence: Selections don't affect each other's probability
  4. Apply formula: Use C(n,r) = n!/[r!(n-r)!]
  5. Calculate: Simplify factorials carefully
  6. Verify: Check if the answer is reasonable
Tip 1: If rearranging selected items gives the same outcome, use combinations.
Tip 2: Use symmetry property: C(n,r) = C(n,n-r) to simplify calculations.
Tip 3: Cancel factorials before multiplying to avoid large numbers.
Tip 4: Remember that C(n,1) = n and C(n,2) = n(n-1)/2.
Common errors: Using permutations when combinations are needed, forgetting to account for order irrelevance, miscalculating factorials.
Key insight: Combinations count unique groups, not arrangements within groups.
Formulas to know by heart:

• 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)\)

Solution: Exercises 4 to 5
4 Card Hands
Exercise 4
From a standard deck of 52 cards, how many different 5-card poker hands are possible?
Definition:

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.

Deck size
n=52
Hand size
r=5
Formula
C(52,5)
Calculation
52!/(5!×47!)
Result
2,598,960
Step 1: Identify the problem type

A poker hand is a selection of 5 cards from 52, where the order of cards doesn't matter.

Step 2: Apply the combination formula

C(52,5) = 52!/(5!×47!) = (52×51×50×49×48×47!)/(5!×47!)

Step 3: Simplify and calculate

C(52,5) = (52×51×50×49×48)/(5×4×3×2×1) = 311,875,200/120 = 2,598,960

2,598,960 different poker hands
Final answer:

There are 2,598,960 different 5-card poker hands possible.

Applied rules:

• 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

5 Committee with Constraints
Exercise 5
A committee of 4 people is to be selected from 6 men and 5 women. How many committees have exactly 2 men and 2 women?
Definition:

Constrained Selection: When a problem has specific requirements (like exact numbers from different groups), break it into separate combination problems and multiply the results.

Select 2 men from 6
C(6,2)
Select 2 women from 5
C(5,2)
Total
C(6,2)×C(5,2)
Result
15×10=150
Step 1: Break down the constraint

We need exactly 2 men AND exactly 2 women. We'll calculate each separately.

Step 2: Calculate men selection

Select 2 men from 6: C(6,2) = 6!/(2!×4!) = (6×5)/2 = 15

Step 3: Calculate women selection

Select 2 women from 5: C(5,2) = 5!/(2!×3!) = (5×4)/2 = 10

Step 4: Apply fundamental counting principle

Total committees = 15 × 10 = 150

150 committees with exactly 2 men and 2 women
Final answer:

There are 150 different committees with exactly 2 men and 2 women.

Applied rules:

• Independent selections: Men and women selections are independent

• Multiple constraints: Calculate each constraint separately

• FCP application: Multiply independent combination results

Comprehensive Summary: Combinations (Order Doesn't Matter)
\(C(n,r) = \binom{n}{r} = \frac{n!}{r!(n-r)!}\)
Combination Formula
Key definitions:

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.

Complete methodology:
  1. Problem identification: Determine if order matters (use combinations if it doesn't)
  2. Object counting: Identify total objects (n) and objects to select (r)
  3. Constraint analysis: Check for specific requirements or groupings
  4. Formula selection: Use appropriate combination formula
  5. Calculation: Simplify factorials carefully, cancel common terms
  6. Verification: Check if the answer is reasonable and meets problem requirements
Tip 1: Keywords indicating combinations: "select," "choose," "group," "team," "committee," "subset."
Tip 2: Use symmetry property: C(n,r) = C(n,n-r) to work with smaller numbers.
Tip 3: Cancel factorials before multiplying to avoid large calculations.
Tip 4: For constrained problems, break into separate combination problems.
Tip 5: Always verify that order truly doesn't matter in the context of the problem.
Common errors: Using permutations when combinations are needed, forgetting to account for order irrelevance, miscalculating factorials, not properly handling constraints.
Memorization aid: "Combination = Collection matters, not order" (both start with C).
Advanced insight: Combinations form the basis for probability distributions and binomial theorem.
Essential rules and formulas:

• 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\)

Example progression (Simple to Complex):

• 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

Key takeaways for memorization:

• "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)).